Explain why should not choose primes too close together


1) Find the primes p and q if n = pq= 4,386,607 and φ(n) = 4,382,136.

2) Explain why we should not choose primes p and q that are too close together to form the encrypting exponent n in the RSA cryptosystem. In particular, show that using a pair of twin primes for p and q would be disastrous. (Hint: Recall Fermat's factorization method.)

 

Solution Preview :

Prepared by a verified Expert
Computer Network Security: Explain why should not choose primes too close together
Reference No:- TGS0696140

Now Priced at $10 (50% Discount)

Recommended (98%)

Rated (4.3/5)