Unformatted text preview: c : m :.p ² 1;q ² 1/ . Use the isomorphism ˚.pq/ Š ˚.p/ ± ˚.q/ to show that a m ³ 1 . mod n/ whenever a is relatively prime to n . 1.12.2. Show that if a snoop were able to ﬁnd '.n/ , then he could also ﬁnd p and q . 1.12.3. Suppose that Andr´e needs to send a message to Bernice in such a way that Bernice will know that the message comes from Andr´e and not from some impostor. The issue here is not the secrecy of the message but rather its authenticity. How can the RSA method be adapted to solve the problem of message authentiﬁcation? 1.12.4. How can Andr´e and Bernice adapt the RSA method so that they can exchange messages that are both secure and authenticated?...
View
Full
Document
This note was uploaded on 12/15/2011 for the course MAC 1105 taught by Professor Everage during the Fall '08 term at FSU.
 Fall '08
 EVERAGE
 Algebra, Cryptography

Click to edit the document details