[1502] in cryptography@c2.net mail archive
Re: Speeding up DH
daemon@ATHENA.MIT.EDU (William Allen Simpson)
Tue Sep 16 14:20:20 1997
Date: Tue, 16 Sep 97 15:14:00 GMT
From: "William Allen Simpson" <wsimpson@greendragon.com>
To: cryptography@c2.net
It helps a bit if we all speak the same terminology. This was a private
response, but perhaps the broader group would benefit.
When writing up Photuris, Karn used the term "strong prime". After
conversations with others and some paper references, and then the
Handbook was published, we discovered that a better term was "safe" prime.
http://www.math.washington.edu/~warfield/news/news20.html
http://www.vma.bme.hu/mathhist/Mathematicians/Germain.html
Summary thanks to Lewis McCarthy <lmccarth@cs.umass.edu>:
safe prime ---
From Menezes et al., op. cit., Definition 4.85:
"A safe prime p is a prime of the form p = 2q+1 where q is prime."
Sophie Germain prime ---
From Chris Caldwell's "The Prime Page" at U. Tennessee-Martin,
<http://www.utm.edu/research/primes/types.html#sophie>:
"If both p and 2p+1 are prime, then p is a Sophie Germain prime.
Around 1825 Sophie Germain proved that the first case of Fermat's
last theorem is true for such primes."
From Paul Zimmermann's "Records for Prime Numbers" at INRIA Lorraine,
<http://www.loria.fr/~zimmerma/records/primes.html>:
"Sophie Germain primes P are such that P and 2P+1 are prime. See the
paper from Harvey Dubner in Math. of Comp. v65 n213, 1996, 393-396."
WSimpson@UMich.edu
Key fingerprint = 17 40 5E 67 15 6F 31 26 DD 0D B9 9B 6A 15 2C 32
BSimpson@MorningStar.com
Key fingerprint = 2E 07 23 03 C5 62 70 D3 59 B1 4F 5E 1D C2 C1 A2
