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 = 1801, g 6 and r = 84. = What is the smallest positive integer e such that r = gº mod p?

icon
Related questions
Question
100%
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 1801,
=
9 6 and r = 84.
=
What is the smallest positive integer e such that
r = ge mod p?
Transcribed Image Text: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 1801, = 9 6 and r = 84. = What is the smallest positive integer e such that r = ge mod p?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 2 images

Blurred answer