Unformatted text preview: prime factorization. 3) We proved that a message M correctly gets encrypted and decrypted using RSA encryption when gcd(M,n) = 1. Prove that the message M ALSO gets encrypted correctly when gcd(M,n) > 1. 4) Prove the following result stated on page 123 of the text: If α is a primitive element modulo p and β = α i , then the order of β modulo p is (p – 1)/gcd(p – 1, i)....
View
Full Document
 Summer '09
 Cryptography, α, Integer factorization, primitive element modulo, Cryptography Summer ’01

Click to edit the document details