On Saturday 17 August 2002 03:22, Halliday, Ian wrote: > In http://msn.com.com/2100-1104-949170.html?type=pt we read > > Crypto scientists crack prime problem > > To create encryption keys, RSA uses two huge prime numbers and > multiplies them together to produce an even bigger prime.
The hard problem RSA relies upon is not finding whether a number is prime, but finding its factors if it isn't. But someone who thinks that the product of two prime numbers is prime doesn't know the difference. Then there's the discrete logarithm problem, which he probably doesn't know from the concrete logrolling problem. phma _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers