(1 point) One of the one-way functions used in public key cryptography is the discrete logarithm. Computing r = ge mod p
Posted: Sat May 14, 2022 6:38 pm
(1 point) One of the one-way functions used in public key cryptography is the discrete logarithm. Computing r = ge mod p from g, e, and p is easy. But given only r, g and p, recovering e is hard. Suppose p = 1733, 9 = 7 and r = 541 What is the smallest positive integer e such that r = ge mod p?