One of the one-way functions used in public key cryptography is the discrete logarithm. Computing r...

Transcribed Image Text:

One of the one-way functions used in public key cryptography is the discrete logarithm. Computing r = g mod p from g, e, and p is easy. But given only r, g and p, recovering e is hard. Suppose p= 1013, g = 7 and r = 101. What is the smallest positive integer e such that r = g mod p? One of the one-way functions used in public key cryptography is the discrete logarithm. Computing r = g mod p from g, e, and p is easy. But given only r, g and p, recovering e is hard. Suppose p= 1013, g = 7 and r = 101. What is the smallest positive integer e such that r = g mod p?

Answer rating: 100% (QA)

To find the smallest positive integer e such that r ge mod p you can use the discrete logarithm algo... View the full answer