[12638] in cryptography@c2.net mail archive
ENC: Proven Primes
daemon@ATHENA.MIT.EDU (Mads Rasmussen)
Thu Mar 6 12:15:08 2003
X-Original-To: cryptography@wasabisystems.com
X-Original-To: cryptography@wasabisystems.com
Date: Thu, 6 Mar 2003 12:15:58 -0300
From: "Mads Rasmussen" <mads@opencs.com.br>
To: "Cryptography" <cryptography@wasabisystems.com>
> -----Mensagem original-----
> De: Ben Laurie [mailto:ben@algroup.co.uk]
> Enviada em: quinta-feira, 6 de mar=E7o de 2003 08:47
> Para: Cryptography
> Assunto: Proven Primes
>=20
> I'm looking for a list or lists of sensibly sized proven primes - all
> the lists I can find are more interested in records, which are _way_
too
> big for cryptographic purposes.
>=20
> By "sensibly sized" I mean in the range 512-8192 bits. I'm
particularly
> after Sophie Germain primes right now, but I guess all primes are of
> interest.
You might look at the IKE groups
The Internet Key Exchange (IKE)=20
http://www.ietf.org/rfc/rfc2409.txt
"More MODP Diffie-Hellman groups for IKE"
http://www.ietf.org/internet-drafts/draft-ietf-ipsec-ike-modp-groups-05.
txt
Regards,
Mads
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
