math135-a9-2011

math135-a9-2011 - Assignment 9 Questions 1. (a) Given n =...

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

View Full Document Right Arrow Icon
Assignment 9 – Questions 1. (a) Given n = pq , p > q , and φ ( n ) = ( p - 1)( q - 1) prove that p + q = n - φ ( n ) + 1 and p - q = p ( p + q ) 2 - 4 n. (b) The integer n = 71531 is the product of two primes p and q , and the Euler phi function φ ( n ) = ( p - 1)( q - 1) = 70992. Determine the prime factors p and q . 2. Use Fermat’s Little Theorem and the Square and Multiply Algorithm to prove that the integer 2479 is not prime (without testing each prime p 2479 to see if is a factor). 3. (a) In an RSA scheme, the public key (
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/24/2011 for the course MATH 135 taught by Professor Andrewchilds during the Winter '08 term at Waterloo.

Ask a homework question - tutors are online