Unformatted text preview: 5). 6. Let f be a multiplicative function. Show that X d  n μ ( d ) f ( d ) = Y p  n , p prime (1f ( p )) . 7. Find the primes p and q if n = pq = 4 , 386 , 607 and φ ( n ) = 4 , 382 , 136. 8. Suppose that in an RSA encoded message one of the encoded blocks C turns out to be not relatively prime to n = pq . (a) Show that using that C (and the encyphering exponent and modulus e and n ) a cryptanalist can factor n , hence break the code. (b) If p and q have, say, 100 digits, what is the probability that such a “bad” block will actually occur? 1...
View
Full
Document
This note was uploaded on 04/08/2008 for the course MATH 115A taught by Professor Santos during the Fall '07 term at UC Davis.
 Fall '07
 Santos
 Math, Number Theory

Click to edit the document details