Ben Laurie writes:
I actually just finished finding the 16384 bit Diffie-Helman group
with same kind of parameters. It took about 9.5 months to generate.
The 12288 bit group took only about 15 days to generate.
I have to admit to surprise at the time involved - what s/w are you
using to
--- Tero Kivinen [EMAIL PROTECTED] wrote:
SOPHIE GERMAIN PRIME SEARCH
FIXED 64 bits.
INDEX 0:
PRIME (bits 512), index = 131, 0.989151 seconds:
0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a439d
What is the
- Original Message -
From: tom st denis [EMAIL PROTECTED]
To: Cryptography [EMAIL PROTECTED]
Sent: Tuesday, March 11, 2003 11:28 AM
Subject: Re: Proven Primes
--- Tero Kivinen [EMAIL PROTECTED] wrote:
SOPHIE GERMAIN PRIME SEARCH
FIXED 64 bits.
INDEX 0:
PRIME (bits 512), index
tom st denis writes:
0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a439d
What is the benefit of having leading/trailing bits fixed?
Those primes are generated using the rules defined in the RFC 2412.
As far as I
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
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
Jack Lloyd wrote:
I believe the IPSec primes had been proven. All are SG primes with a g=2
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.
RFC 2412 looks good, however, as you
Tom St Denis [EMAIL PROTECTED] has a program that constructs provable
primes, by bootstrapping them from smaller proven primes. The trouble is
that his stuff is off the air at the moment. You might write to him,
though. It's pretty quick, IIRC.
Greg.
At 06:45 PM 3/8/2003 +, Ben Laurie
At 9:21 PM -0800 3/6/03, Ben Laurie wrote:
Bill Frantz wrote:
At 3:47 AM -0800 3/6/03, Ben Laurie wrote:
I'm looking for a list or lists of sensibly sized proven primes - all
the lists I can find are more interested in records, which are _way_ too
big for cryptographic purposes.
By sensibly
At 2:04 AM -0800 3/7/03, Ben Laurie wrote:
BTW, a terminology nit - a Sophie Germain prime is one such that p and
2p+1 are prime - I'll be that what you've given me is one such that p
and (p-1)/2 are prime, right?
Yes. And I do know that the Sophie Germain prime is the smaller of the two
related
At 10:04 AM 3/7/2003 +, Ben Laurie wrote:
Indeed. The commonly used one is ECPP which uses elliptic curves cunningly
to not only prove primality, but to produce a certificate which can be
quickly verified.
Probabilistic prime tests are just that - probable. ECPP actually proves it.
Does
Bill Frantz wrote:
I guess I'm dumb, but how to you verify a proof of Sophie Germain primeness
with less effort than to run the tests yourself?
There are ways to prove that p is prime so that the receiver
can verify the proof more easily than it would be to construct
a proof. The verification
I thought that finding them was the hard part, and verifying one once
found
was relatively easy. I used the probable prime test in the Java
BigInteger
package. It sounds like, from some of the list traffic, that there are
better tests.
Chapter 4 of the HAC gives a good introduction to all
- Original Message -
From: Ben Laurie [EMAIL PROTECTED]
To: Cryptography [EMAIL PROTECTED]
Sent: Thursday, March 06, 2003 6:47 AM
Subject: Proven Primes
I'm looking for a list or lists of sensibly sized proven primes - all
the lists I can find are more interested in records, which are
I believe the IPSec primes had been proven. All are SG primes with a g=2
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.
On Thu, 6 Mar 2003, Ben Laurie wrote:
I'm looking
- Original Message -
From: Ben Laurie [EMAIL PROTECTED]
To: Anton Stiglic [EMAIL PROTECTED]
[Talking about the ECPP package...]
I'm not convinced any of those binaries are going to run on my system
(which is FreeBSD), and anyway, if I'm going to use a binary to do ECPP
I may as well
At 3:47 AM -0800 3/6/03, Ben Laurie wrote:
I'm looking for a list or lists of sensibly sized proven primes - all
the lists I can find are more interested in records, which are _way_ too
big for cryptographic purposes.
By sensibly sized I mean in the range 512-8192 bits. I'm particularly
after
17 matches
Mail list logo
