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
Posted: Thu May 05, 2022 1:33 pm
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 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.