[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Factorisation and Discrete Logs (was Re: EE Times on PRZ)

To: [email protected] (Dana Albrecht)
Subject: Re: Factorisation and Discrete Logs (was Re: EE Times on PRZ)
From: Derek Atkins <[email protected]>
Date: Wed, 18 Jan 1995 22:57:30 EST
Cc: [email protected]
In-Reply-To: Your message of "Wed, 18 Jan 1995 19:39:26 PST." <[email protected]>
Sender: [email protected]

> Comments, anyone?

You are right...  Given talks Ive had with Brian LaMacchia, who broke
a version of "Secure SunRPC" (a 192-bit prime), he claims that the
difficulty is reducing a D-L problem is about the same amount of
computation to factorize an RSA modulus of approximately the same
size..

So, within napkin-computation, you are correct.

-derek

Follow-Ups:
- Re: Factorisation and Discrete Logs
  - From: [email protected] (Mike Duvos)

References:
- Factorisation and Discrete Logs (was Re: EE Times on PRZ)
  - From: [email protected] (Dana Albrecht)

Prev by Date: Re: FBI and BLACKNET
Next by Date: Re: Lance Rose writes anti-cryptoanarchy in WIRED
Prev by thread: Factorisation and Discrete Logs (was Re: EE Times on PRZ)
Next by thread: Re: Factorisation and Discrete Logs
Index(es):
- Date
- Thread