Crypton Versions Save

What's new in v2.0:

1. Discrete Logarithm Problem
   • Cyclic Groups
   • Lagrange's Theorem
   • Naive approach
     • Explanation
     • Implementation
   • Baby Step Giant Step
     • Explanation
     • Implementation
   • Pohlig-Hellman
     • Explanation
     • Implementation
   • Pollard's Rho
     • Explanation
     • Implementation
2. Elliptic Curves
   • Implementation of Elliptic Curve Arithmetic
     • In sagemath
     • In pure python
   • Double and Add algorithm for Scalar Multiplication
     • Explanation
     • Implementation
3. Elliptic Curve Discrete Logarithm Problem
   • Cyclic Groups in Elliptic Curves
   • Naive approach
     • Explanation
     • Implementation
   • Baby Step Giant Step
     • Explanation
     • Implementation
   • Pollard's Rho
     • Explanation
     • Implementation
     • CTF Challenges
4. Identification Protocols
   • Identification basics
   • Algorithms for identification
   • Naive algorithm
   • Ephemeral Key Authentication
     • Internals
     • Forging Identity
     • CTF Challenges
5. Diffie Hellman Key Exchange
   • Key Exchange internals
   • Trivial implementation
   • Small Subgroup Confinement Attack
     • Explanation
     • CTF Challenges
   • Invalid Curve Point Attack
     • Explanation
     • Implementation
     • CTF Challenges
6. Least Significant Bit Oracle Attack on unpadded RSA
   • Explanation
   • Implementation
   • CTF Challenges
7. Extracting modulus from an unpadded RSA encryption service
   • Explanation
   • Implementation
   • CTF Challenges
8. Modified ElGamal encryption
   • Explanation
   • Implementation
9. Added CTF challenges
   • Coppersmith's Attack

Initial release