----- Original Message ----- From: "Halliday, Ian" <[EMAIL PROTECTED]> To: <[EMAIL PROTECTED]> Sent: Saturday, August 17, 2002 8:22 AM Subject: Mersenne: Crypto scientists crack prime problem, not Redmond journalists
> 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. So take any Mersenne prime, and multiply by a Fermat prime to obtain a new larger Mersenne prime. Rinse and repeat. Why didn't we think of that? > Regards, > > Ian Daran _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
