Number-theoretic Preliminaries

• Modular arithmetic

  • Digression about cryptanalytic attacks

• Prime numbers

• Greatest common divisor

• Inverses modulo a number

• Fermat’s Little Theorem

• Euler Totient Function

• Chinese Remainder Theorem

  • Factoring
  • Prime Number Generation

Previous slide

Next slide

Back to first slide

View graphic version