Unformatted text preview: p ≤ √ 3599 to see if is a factor. (Hint: compute 2 3598 (mod 3599)). Problem 3 . (a) Let p = 53, q = 61, e = 241 and n = pq . Encrypt the message 1047 using the RSA public key ( e,n ). (b) Let p = 53, q = 61, e = 2641 and n = pq . Decrypt the cyphertext c = 2818 which was encoded from a 2letter message using the RSA public key ( e,n ). 1...
View
Full Document
 Spring '08
 ANDREWCHILDS
 Cryptography, Prime Numbers, Prime number, little theorem, Multiply Algorithm

Click to edit the document details