On 28 May 2014 00:03, Viktor Dukhovni openssl-us...@dukhovni.org wrote:
On Tue, May 27, 2014 at 09:04:20PM +0100, Ben Laurie wrote:
It inspired my son, Felix, and I to think about a related idea:
generate random numbers which are inherently coprime to small primes.
Felix went on to implement
this could be quicker than incremental search
And sorry if I'm mistaking anyhow
Nico
- Mail d'origine -
De: Ben Laurie b...@links.org
À: OpenSSL development openssl-dev@openssl.org
Envoyé: Wed, 28 May 2014 11:10:25 +0200 (CEST)
Objet: Re: open ssl rsa key generation improvement idea
On 28
Envoyé: Wed, 28 May 2014 11:10:25 +0200 (CEST)
Objet: Re: open ssl rsa key generation improvement idea
On 28 May 2014 00:03, Viktor Dukhovni openssl-us...@dukhovni.org wrote:
On Tue, May 27, 2014 at 09:04:20PM +0100, Ben Laurie wrote:
It inspired my son, Felix, and I to think about a related
deeper into details
- Mail d'origine -
De: Ben Laurie b...@links.org
À: OpenSSL development openssl-dev@openssl.org
Envoyé: Wed, 28 May 2014 14:54:00 +0200 (CEST)
Objet: Re: Re : Re: open ssl rsa key generation improvement idea Prime
generation
On 28 May 2014 13:32, nicolas@free.fr
Nice idea.
It inspired my son, Felix, and I to think about a related idea:
generate random numbers which are inherently coprime to small primes.
Felix went on to implement the idea, and include benchmarks and tests.
Not finished - while implementing, we noticed that the existing prime
number
Of Ben Laurie
Sent: Tuesday, May 27, 2014 4:04 PM
To: OpenSSL development; Felix Laurie von Massenbach
Subject: Re: open ssl rsa key generation improvement idea
Nice idea.
It inspired my son, Felix, and I to think about a related idea:
generate random numbers which are inherently coprime to small
On Tue, May 27, 2014, Ben Laurie wrote:
Nice idea.
It inspired my son, Felix, and I to think about a related idea:
generate random numbers which are inherently coprime to small primes.
Felix went on to implement the idea, and include benchmarks and tests.
Not finished - while
I've converted all the divisibility rules for all the primes less than 25
into binary. All the sums can be calculated at once.
Nice work!
/r$
--
Principal Security Engineer
Akamai Technologies, Cambridge, MA
IM: rs...@jabber.me; Twitter: RichSalz
Also, I should note that this approach is not portable. You need to
operate in the same base as BIGNUM does, or account for endianness is
the byte-level operations.
On 26 May 2014 02:31, Russell Harkins russ...@russellharkins.info wrote:
Hi SSL Team,
I was looking for ways to make calculating
On Tue, May 27, 2014 at 09:04:20PM +0100, Ben Laurie wrote:
It inspired my son, Felix, and I to think about a related idea:
generate random numbers which are inherently coprime to small primes.
Felix went on to implement the idea, and include benchmarks and tests.
When you say small, you mean
Hi SSL Team,
I was looking for ways to make calculating RSA public/private keys faster.
I noticed that trial division was being done to test if a number is
divisible by small primes.
Roughly 2/3 of all odd numbers are divisible by primes less than 25. I
found a faster way to test the divisibility
11 matches
Mail list logo
