This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 1.12. AN APPLICATION TO CRYPTOGRAPHY 81 Similarly, p divides a h a . But then a h a is divisible by both p and q , and hence by n D pq D l : c : m :.p;q/ . n Let r be any natural number relatively prime to m , and let s be an inverse of r modulo m , rs 1 . mod m/ . We can encrypt and decrypt natural numbers a that are relatively prime to n by first raising them to the r th power modulo n , and then raising the result to the s th power modulo n . Lemma 1.12.2. For all integers a , if b a r . mod n/; then b s a . mod n/: Proof. Write rs D 1 C tm Then b s a rs D a . mod n/ , by Lemma 1.12.1 . n Here is how these observations can be used to encrypt and decrypt information: I pick two very large primes p and q , and I compute the quantities n , m , r , and s . I publish n and r (or I send them to you privately, but I dont worry very much if some snoop intercepts them). I keep p , q , m , and s secret....
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