This preview shows page 1. Sign up to view the full content.
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
This document was uploaded on 07/14/2011.
- Summer '09