At 9:35 PM -0500 3/8/03, Dave Emery wrote:
On Fri, Mar 07, 2003 at 10:46:06PM -0800, Bill Frantz wrote:
The next more complex version sends the same random screen over and over in
sync with the monitor. Even more complex versions change the random screen
every-so-often to try to frustrate
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 [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Cc: David Wagner [EMAIL PROTECTED]
Ben Laurie writes:
Jack Lloyd wrote:
Check RFC 2412, draft-ietf-ipsec-ikev2-05.txt, and
draft-ietf-ipsec-ike-modp-groups-05.txt
However, I don't seen any primality proof certificates included in the
texts.
I considered adding the ecpp certificates to
draft-ietf-ipsec-ike-modp-groups
I have updated the Lucre paper with a new section on choosing
parameters, in response to question from the lucrative project.
It can be found in the usual place: http://anoncvs.aldigital.co.uk/lucre/.
If I find (or write) free software that does primality proofs, then I
guess I'll update it
Tero Kivinen wrote:
Ben Laurie writes:
Jack Lloyd wrote:
Check RFC 2412, draft-ietf-ipsec-ikev2-05.txt, and
draft-ietf-ipsec-ike-modp-groups-05.txt
However, I don't seen any primality proof certificates included in the
texts.
I considered adding the ecpp certificates to
