MAT135-Assignment9

MAT135-Assignment9 - p 3599 to see if is a factor. (Hint:...

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

View Full Document Right Arrow Icon
MATH 135, Fall 2010 Assignment #9 Due at 4:00pm on Tuesday, November 23 Problem 1 . Suppose that p and q are prime numbers with p > q . Suppose also that n = pq and φ ( n ) = ( p - 1)( q - 1). (a) Prove that p + q = n - φ ( n ) + 1 and p - q = p ( p + q ) 2 - 4 n . (b) If n = 1 281 783 203 and φ ( n ) = 1 281 711 600, determine p and q . Problem 2 . Use Fermat’s Little Theorem and the Square and Multiply Algorithm to show that the integer 3599 is not prime, without testing each prime
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 2-letter message using the RSA public key ( e,n ). 1...
View Full Document

This note was uploaded on 12/10/2010 for the course MATH 135 taught by Professor Andrewchilds during the Spring '08 term at Waterloo.

Ask a homework question - tutors are online