Some cool cryptography projects...
– Implements one function which solves the Eulers Totient for a given number
– Given encryption exponent and modulus n, solves for the decryption exponent by factoring n using a p - 1 approach
- Solves discrete log using the Pollig Hellman algorithm of 90 digit modulus and base