[12733] in cryptography@c2.net mail archive
Re: Proven Primes
daemon@ATHENA.MIT.EDU (tom st denis)
Tue Mar 11 11:35:40 2003
X-Original-To: cryptography@wasabisystems.com
X-Original-To: cryptography@wasabisystems.com
Date: Tue, 11 Mar 2003 08:28:32 -0800 (PST)
From: tom st denis <tomstdenis@yahoo.com>
To: Cryptography <cryptography@wasabisystems.com>
In-Reply-To: <15981.56221.302956.977240@fireball.acr.fi>
--- Tero Kivinen <kivinen@iki.fi> wrote:
> SOPHIE GERMAIN PRIME SEARCH
> FIXED 64 bits.
> INDEX 0:
> PRIME (bits 512), index = 131, 0.989151 seconds:
>
0xffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a439dffffffffffffffff
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.
Tom
__________________________________________________
Do you Yahoo!?
Yahoo! Web Hosting - establish your business online
http://webhosting.yahoo.com
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
