[12722] in cryptography@c2.net mail archive
Re: prime proofs
daemon@ATHENA.MIT.EDU (Anton Stiglic)
Mon Mar 10 09:43:20 2003
X-Original-To: cryptography@wasabisystems.com
X-Original-To: cryptography@wasabisystems.com
From: "Anton Stiglic" <astiglic@okiok.com>
To: "Richard Schroeppel" <rcs@CS.Arizona.EDU>,
<cryptography@wasabisystems.com>
Cc: "David Wagner" <daw@mozart.cs.berkeley.edu>
Date: Mon, 10 Mar 2003 09:23:19 -0500
The contribution of Pratt was to be the first to publish a proof
that the certificate can be verified in polynomial time (thus proving
that PRIMES is in NP).
--Anton
----- Original Message -----
From: "Richard Schroeppel" <rcs@CS.Arizona.EDU>
To: <cryptography@wasabisystems.com>
Cc: "David Wagner" <daw@mozart.cs.berkeley.edu>
Sent: Friday, March 07, 2003 5:06 PM
Subject: prime proofs
> 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
>
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
