Cryptography, Encryption, Cybersecurity.
pow(1,3,5) 1 >>> pow(3,3,5) 2 >>> pow(2,3,5) 3 >>> pow(4,3,5) 4 And, so we have reversed our modulo logarithm. Overall, the magic of PHI is at the core of the RSA method and where we can reverse the exponentiation operation. For this, we have a cipher of: C= M^e (mod N) and then can reverse with a