Displaying 3 results from an estimated 3 matches for "a014233".
2015 May 26
2
Weak DH primes and openssh
On Tue 2015-05-26 12:57:05 -0400, Hubert Kario wrote:
> creating composites that will pass even 100000 rounds of Miller-Rabin is
> relatively simple....
> (assuming the values for M-R tests are picked randomly)
Can you point me to the algorithms for doing that? This would suggest
that we really do want primality proofs (and a good way to verify them).
Do those algorithms hold for
2015 May 26
8
Weak DH primes and openssh
..., Hubert Kario wrote:
>> > creating composites that will pass even 100000 rounds of Miller-Rabin is
>> > relatively simple....
>> > (assuming the values for M-R tests are picked randomly)
>>
>> Can you point me to the algorithms for doing that?
>
> OEIS A014233
Hm, this is a sequence, but not an algorithm. It looks to me like it is
not exhaustive, just a list of those integers which are known to have
the stated property ("Smallest odd number for which Miller-Rabin
primality test on bases <= n-th prime does not reveal compositeness").
Takin...
2015 May 27
3
Weak DH primes and openssh
On Wed 2015-05-27 05:23:41 -0400, Hubert Kario wrote:
> On Tuesday 26 May 2015 15:10:01 Daniel Kahn Gillmor wrote:
>> On Tue 2015-05-26 14:02:07 -0400, Hubert Kario wrote:
>> > OEIS A014233
>>
>> Hm, this is a sequence, but not an algorithm. It looks to me like it is
>> not exhaustive, just a list of those integers which are known to have
>> the stated property ("Smallest odd number for which Miller-Rabin
>> primality test on bases <= n-th prime...