Well, I'm attacking a protocol, I know the rules of DH parameters, and the
issue here is I'm trying to solve x, brute forcing that in the 128 bit
range
can be difficult, and x doesn't have to be a prime. (a = g^x mod P). Their
primes are 128 bit primes, as well as their pubkeys, I've done
- Original Message -
From: NOP [EMAIL PROTECTED]
To: Derek Atkins [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Friday, March 14, 2003 9:32 PM
Subject: Re: Diffie-Hellman 128 bit
Well, I'm attacking a protocol, I know the rules of DH parameters, and the
issue here is I'm trying
At 13/03/03 23:48, you wrote:
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), so what attacks are there that I can look at
On Fri, 14 Mar 2003, NOP wrote:
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
If they're using 128-bit primes, you don't really need to look for
breaks - just throw a cpu at it and you're
At 01:48 PM 03/13/2003 -0800, NOP wrote:
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), so what attacks are there that I
- Original Message -
From: NOP [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
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
AM
Subject: Re: Diffie-Hellman 128 bit
- Original Message -
From: NOP [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
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
Hi,
I'm sorry to inform you, but a brute-force attack on a 128-bit prime
is simple to mount. I don't think I can estimate the length of time
to attack a prime of this length, but it wouldn't be very long.
Consider that 425 bits is only about 4KMY (Kilo-MIP-Years) -- with
todays 2KM+ processors
: [EMAIL PROTECTED]
Sent: Friday, March 14, 2003 10:53 AM
Subject: Re: Diffie-Hellman 128 bit
Hi,
I'm sorry to inform you, but a brute-force attack on a 128-bit prime
is simple to mount. I don't think I can estimate the length of time
to attack a prime of this length, but it wouldn't be very long
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), so what attacks are there that I can look at
to come up with either the
10 matches
Mail list logo
