[12735] in cryptography@c2.net mail archive
Re: Proven Primes
daemon@ATHENA.MIT.EDU (Jeroen C. van Gelderen)
Tue Mar 11 18:04:07 2003
X-Original-To: cryptography@wasabisystems.com
X-Original-To: cryptography@wasabisystems.com
Date: Tue, 11 Mar 2003 11:53:26 -0500
Cc: Cryptography <cryptography@wasabisystems.com>
To: tom st denis <tomstdenis@yahoo.com>
From: "Jeroen C. van Gelderen" <jeroen@vangelderen.org>
In-Reply-To: <20030311162832.57953.qmail@web41111.mail.yahoo.com>
On Tuesday, Mar 11, 2003, at 11:28 US/Eastern, tom st denis wrote:
>
> --- Tero Kivinen <kivinen@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@wasabisystems.com
