Thanks. Found the paper after some additional searching.
Met Rivest at RSA Conf. Nice guy. No need for long teeth. Rick -----Original Message----- From: Charles B Cranston [mailto:[EMAIL PROTECTED] Sent: Wednesday, June 04, 2003 7:33 AM To: [EMAIL PROTECTED] Subject: Re: testing for primality Robinson, Richard L (Rick) wrote: > I checked the RSA web site and could not find the paper you > are referencing. Could you please forward me a link? I really don't see how you could have missed it. It is only the 10th listing on their Technical Notes page: http://www.rsasecurity.com/rsalabs/technotes/index.html There are links to both PS and PDF under the title: Are 'Strong' Primes Needed for RSA? Paraphrased from the abstract: We argue that...it is unnecessary to use strong primes in the RSA cryptosystem...There are two parts to this argument. First, the use of strong primes provides NO ADDITIONAL PROTECTION against factoring attacks, because Lenstra's method of factoring based on elliptic curves (ECM) circumvents any protection that might have been offered using string primes... [emphasis added] The authors are Ronald L Rivest and Robert D Silverman. Rivest is, I hope all realize, the R in RSA... For those of us really long in the tooth, the A is the same Adelman (sp?) as in AVL balanced binary trees. I wonder if Vel'ski-Landis (REAL sp?) is still active? -- Charles B (Ben) Cranston mailto: [EMAIL PROTECTED] http://www.wam.umd.edu/~zben ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List [EMAIL PROTECTED] Automated List Manager [EMAIL PROTECTED] ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List [EMAIL PROTECTED] Automated List Manager [EMAIL PROTECTED]
