hmk4 - prime factorization. 3) We proved that a message M...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction to Cryptography Summer ’01 Homework #4 Assigned: Tuesday, 6/26/01 Due: Thursday, 7/12/01 Do the following problems in the textbook(ppg. 157-161): 4.3, 4.4, 4.6(both), 4.7, 4.8 1) Given that gcd(m,n) = 1, prove that φ (mn) = φ (m) φ (n). 2) Using the result from part a, and employing a slightly different strategy than shown in class, prove the result stated on page 10 of the text concerning φ (n), when given n’s
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online