[12703] in cryptography@c2.net mail archive
prime proofs
daemon@ATHENA.MIT.EDU (Richard Schroeppel)
Sat Mar 8 17:10:52 2003
X-Original-To: cryptography@wasabisystems.com
X-Original-To: cryptography@wasabisystems.com
Date: Fri, 7 Mar 2003 15:06:22 -0700 (MST)
From: Richard Schroeppel <rcs@CS.Arizona.EDU>
To: cryptography@wasabisystems.com
Cc: daw@mozart.cs.berkeley.edu (David Wagner)
Dave Wagner writes
> ... Here's a simple method, due to Pratt. ...
People were doing this fourty years before Pratt's paper.
See, for example, Dick Lehmer's 1933 paper "Hunting Big Game
in the Theory of Numbers", where he describes proving primality
for a 19 digit divisor of 2^95+1. It's on my web page at
http://www.cs.arizona.edu/~rcs/biggame4
Or see Math. Comp. in the early 1970s for examples with more
depth in the recursions.
Rich Schroeppel rcs@cs.arizona.edu
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
