Diffie-Hellman 128 bit

NOP nop at trapped-under-ice.com
Fri Mar 14 14:39:50 EST 2003


Nope, it uses 128 bit primes. I'm trying to compute the discrete logarithm
and they are staying within a 128 bit GF(p) field. Sickening.

Thnx.

Lance
----- Original Message -----
From: "Anton Stiglic" <astiglic at okiok.com>
To: "NOP" <nop at trapped-under-ice.com>; <cryptography at wasabisystems.com>
Sent: Friday, March 14, 2003 8:10 AM
Subject: Re: Diffie-Hellman 128 bit


>
> ----- Original Message -----
> From: "NOP" <nop at trapped-under-ice.com>
> To: <cryptography at wasabisystems.com>
> Sent: Thursday, March 13, 2003 4:48 PM
> Subject: Diffie-Hellman 128 bit
>
>
> > I am looking at attacks on Diffie-Hellman.
> >
> > The protocol implementation I'm looking at designed their diffie-hellman
> > using 128 bit primes (generated each time, yet P-1/2 will be a prime, so
> no
> > go on pohlig-hellman attack),
>
> 128-bit prime DH would be trivially breakable, maybe you mean that
> it uses128-bit secret keys (and a larger prime, such as 512-bit prime at
> least)?
>
> In any case, you can probably get all the information you are looking
> for in this manuscript:
> http://crypto.cs.mcgill.ca/~stiglic/Papers/dhfull.pdf
>
> Cheers!
>
> --Anton
>
>


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



More information about the cryptography mailing list