This preview shows page 1. Sign up to view the full content.
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 Andre needs to send a message to Bernice in such a way that Bernice will know that the message comes from Andre 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 authentication? 1.12.4. How can Andre and Bernice adapt the RSA method so that they can exchange messages that are both secure and authenticated?...
View Full
Document
 Fall '08
 EVERAGE
 Algebra, Cryptography

Click to edit the document details