Cryptography, Encryption, Cybersecurity.
to use an inverse log modulo p function. With this, as in the RSA public key encryption method, we find a value for a^x (mod p) so that: x*y (mod PHI) = 1 and where PHI is (p-1). Now we compute: >>> pow(3,-1,4) 3 So we can go ahead and now reverse and find the inverse log for {1,3,2,4} (mod 5): >>>