(1 point) One of the one-way functions used in public key cryptography is the discrete logarithm. Computing r = ge mod p
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
(1 point) One of the one-way functions used in public key cryptography is the discrete logarithm. Computing r = ge mod p
(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?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!