Bodo Moeller wrote:
>
> Export cipher suites need Diffie-Hellman parameters of no more
> than 512 bits.
I noticed that in addition to the relaxtion of the encryption key size
that there have been changes to the size of the key exchange as well.
In particular, a 1024-bit key space can be used wi
. This is itaken
from the source code comments of the stuff I'm going to send
to the people who want it when it's in a fit state for human
consumption.
/*
The Williams-Schmid method for generating strong primes
i.e. primes of the form p = 2q+1 where q is also prime uses
the fol
On Mon, Mar 29, 1999 at 01:12:03PM +, Chad C. Mulligan wrote:
> Bodo Moeller:
>> What exactly do you mean by "strong" primes? BN_generate_prime() uses
>> the word "strong" for what is more commonly called a "safe" prime,
> I mean a "sa
My Quivering Choad tells me that Bodo Moeller had this to say:
> What exactly do you mean by "strong" primes? BN_generate_prime() uses
> the word "strong" for what is more commonly called a "safe" prime,
I mean a "safe" prime, then.
The WS metho
On Sat, Mar 27, 1999 at 04:03:00AM +0100, Bodo Moeller wrote:
> "Safe" primes, where q := (p - 1)/2 is prime, imply that there is
> one very large (order q) subgroup of (Z/pZ)*. More generally,
> we want a large prime q to be some divisor of p - 1. The order of
> the generator selected
onds for BN_generate_prime() with "strong" set to 1.
What exactly do you mean by "strong" primes? BN_generate_prime() uses
the word "strong" for what is more commonly called a "safe" prime,
namely one where (p - 1)/2 is also prime. The word "strong&
Chad C. Mulligan wrote:
> If anyone is interested, I'll post a description of the algorithm and my source code
> and test program so you can all play with it. If you like it, you can stick it in
> OpenSSL to give people a choice of methods.
Yeah, I'm interested.
Cheers,
Ben.
--
http://www.apac
st so long as you have _reasonably large factors of p-1_. So, while a having a
Mersenne prime as a factor of p-1 would be pretty dumb, generally speaking, strong
primes are not as important as once thought. I may have dreamed all this, of
course.
Chad.
___
In article <[EMAIL PROTECTED]> you wrote:
> I've noticed that there is some mention of strong primes in the
> documentation. How are stong primes generated in OpenSSL?
AFAIK the stuff basically works this way:
In a loop per iteration a large enough random number is c
Hi,
I've noticed that there is some mention of strong primes in the
documentation. How are stong primes generated in OpenSSL?
I ask because I have some code (somewhere!) that implements the
Williams-Schmid method for creating these primes by construction.
10 matches
Mail list logo
