Math Alive

Cryptography — Lab 2

Modular arithmetic. Modular multiplication. Fermat's little theorem. Public key cryptography. The RSA algorithm.
PDF Addendum to Part Two with Updates on RSA Challenge and Largest Known Prime (as of Feb. 1, 2009)

Modular Arithmetic
Modular Multiplication
Modular Multiplication of Many Numbers
Calculating Powers Fast
Modular Powers
Modular Calculator
Modular Arithmetic and Fermat
Modular Arithmetic and Fermat - the Proof
Fermat's Little Theorem
RSA Cryptography
RSA Cryptography Practice
Decryption for RSA
Why RSA is Hard to Break?
Prime Factorization

Start the Lab 2

Math Alive

Units

Cryptography — Lab 2