Unformatted text preview: p ≤ √ 2479 to see if is a factor). 3: (a) Encrypt the 1letter message R using the RSA public key ( e, n ) = (13 , 77). (b) Let p = 47, q = 61, e = 43 and n = pq . Encrypt the 2letter message GO using the RSA public key ( e, n ). 4: (a) Decrypt the cyphertext c = 41 which was encoded from a 1letter message using the RSA public key ( e, n ) = (29 , 65). (b) Let p = 41, q = 67, e = 217 and n = pq . Decrypt the cyphertext c = 811 which was encoded from a 2letter message using the RSA public key ( e, n ). 5: (a) Let n = 459061. Given that n = pq for some primes p < q and that φ ( n ) = 457612, ﬁnd the prime factorization of n . (b) Let n = 806437. Given that n = pq for some primes p < q with qp ≤ 100, ﬁnd the prime factorization of n ....
View
Full Document
 Spring '08
 ANDREWCHILDS
 Algebra, Cryptography, Prime number, Bertrand Russell, JOMQ JC MEC, ZBE QOCUE PBDYQEV, QMWSUYL MHBDQ

Click to edit the document details