Number Theory And Cryptographic Math

  1. 1.Why Number Theory Matters for Programmers
  2. 2.Divisibility & the Division Algorithm
  3. 3.Modular Arithmetic
  4. 4.The Euclidean Algorithm & GCD
  5. 5.The Extended Euclidean Algorithm & Modular Inverses
  6. 6.Prime Numbers & Primality Testing
  7. 7.Modular Exponentiation & Fast Exponentiation
  8. 8.Euler's Totient Function & Fermat's Little Theorem
  9. 9.RSA: How the Math Actually Works
  10. 10.Capstone — Building a Toy RSA Implementation
Read as One Page
Number Theory & Cryptographic Math — Complete Course
PDF Downloads
Number_Theory_Cryptographic_Math_Course.pdf
Exercise Solutions
numtheory1-1_challenge1.txtnumtheory1-1_challenge2.txtnumtheory1-1_challenge3.txtnumtheory1-2_challenge1.txtnumtheory1-2_challenge2.txtnumtheory1-2_challenge3.txtnumtheory1-3_challenge1.txtnumtheory1-3_challenge2.txtnumtheory1-3_challenge3.txtnumtheory1-4_challenge1.txtnumtheory1-4_challenge2.txtnumtheory1-4_challenge3.txtnumtheory1-5_challenge1.txtnumtheory1-5_challenge2.txtnumtheory1-5_challenge3.txtnumtheory1-6_challenge1.txtnumtheory1-6_challenge2.txtnumtheory1-6_challenge3.txtnumtheory1-7_challenge1.txtnumtheory1-7_challenge2.txtnumtheory1-7_challenge3.txtnumtheory1-8_challenge1.txtnumtheory1-8_challenge2.txtnumtheory1-8_challenge3.txtnumtheory1-9_challenge1.txtnumtheory1-9_challenge2.txtnumtheory1-9_challenge3.txtnumtheory1-10_challenge1.txtnumtheory1-10_challenge2.txtnumtheory1-10_challenge3.txt