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?
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?
Related questions
Question
100%
![One of the one-way functions used in public key cryptography is the discrete logarithm. Computing \( r \equiv g^e \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 \equiv g^e \mod p? \]
[Input box for answer]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F05306099-d17b-4786-a552-6aca0323abbc%2F6a210eee-33d5-4cbf-80a1-120784d69a07%2Faghroj_processed.jpeg&w=3840&q=75)
Transcribed Image Text:One of the one-way functions used in public key cryptography is the discrete logarithm. Computing \( r \equiv g^e \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 \equiv g^e \mod p? \]
[Input box for answer]
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 2 images
