No code, please explain
Question 3 Say that we have two machines for the RSA, with modulo n = pq. Let M be the message. Say that machine 1 outputs correctly Me mod n. But the second machine outputs c = ((Mª) + 1) mod q. Show how do you use both machines to find what p and q are.
Question 3 Say that we have two machines for the RSA, with modulo n = pq. Let M be the message. Say that machine 1 outpu
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Question 3 Say that we have two machines for the RSA, with modulo n = pq. Let M be the message. Say that machine 1 outpu
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!