Proven Primes

Jeroen C. van Gelderen jeroen at vangelderen.org
Tue Mar 11 11:53:26 EST 2003


On Tuesday, Mar 11, 2003, at 11:28 US/Eastern, tom st denis wrote:

>
> --- Tero Kivinen <kivinen at iki.fi> wrote:
>> SOPHIE GERMAIN PRIME SEARCH
>> FIXED 64 bits.
>> INDEX 0:
>> PRIME (bits 512), index = 131, 0.989151 seconds:
>>
> 0xffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bb 
> ea63b139b22514a08798e3404ddef9519b3cd3a439dffffffffffffffff
>
> What is the benefit of having leading/trailing bits fixed?  As far as I
> know it doesn't make any form of index calculus attack any harder to
> apply.

Performance.

See RFC 2412, Appendix E.

http://www.ietf.org/rfc/rfc2412.txt

-J


---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at wasabisystems.com



More information about the cryptography mailing list