College Algebra Exam Review 73

# College Algebra Exam Review 73 - c m.p ² 1;q ² 1 Use the...

This preview shows page 1. Sign up to view the full content.

1.12. AN APPLICATION TO CRYPTOGRAPHY 83 You send me b in an e–mail message. I recover a by raising b to the s th power and reducing modulo n . I then recover the list of character codes by extracting the base 256 digits of a and ﬁnally I use an ASCII character code table to restore your message “ALGEBRA IS REALLY INTERESTING”. It goes without saying that one does not do such computations by hand. The Mathematica notebook RSA.nb on my Web site contains programs to automate all the steps of ﬁnding large primes, and encoding, encrypting, decrypting, and decoding a text message. Exercises 1.12 1.12.1. (a) Let G Š H ± K be a direct product of ﬁnite groups. Show that every element in G has order dividing l : c : m :. j H j ; j K j / . (b) Let n D pq the product of two primes, and let m D l :
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online