1995-01-19 - Re: Factorisation and Discrete Logs (was Re: EE Times on PRZ)

Header Data

From: Derek Atkins <warlord@MIT.EDU>
To: dwa@mirage.svl.trw.com (Dana Albrecht)
Message Hash: 9291836eb834baa5cf5c06b630907e1ab09d9df7c1329e164bd52885ff8b4e3f
Message ID: <9501190357.AA12988@toxicwaste.media.mit.edu>
Reply To: <9501190339.AA20854@mirage.svl.trw.com>
UTC Datetime: 1995-01-19 04:03:06 UTC
Raw Date: Wed, 18 Jan 95 20:03:06 PST

Raw message

From: Derek Atkins <warlord@MIT.EDU>
Date: Wed, 18 Jan 95 20:03:06 PST
To: dwa@mirage.svl.trw.com (Dana Albrecht)
Subject: Re: Factorisation and Discrete Logs (was Re: EE Times on PRZ)
In-Reply-To: <9501190339.AA20854@mirage.svl.trw.com>
Message-ID: <9501190357.AA12988@toxicwaste.media.mit.edu>
MIME-Version: 1.0
Content-Type: text/plain


> 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

Thread

• Return to January 1995

• Return to “Brian A. LaMacchia <bal@martigny.ai.mit.edu>”
• Return to “Derek Atkins <warlord@MIT.EDU>”
• Return to “dwa@mirage.svl.trw.com (Dana Albrecht)”

• Return to “mpd@netcom.com (Mike Duvos)”

• 1995-01-19 (Wed, 18 Jan 95 19:39:07 PST) - Factorisation and Discrete Logs (was Re: EE Times on PRZ) - dwa@mirage.svl.trw.com (Dana Albrecht)
  • 1995-01-19 (Wed, 18 Jan 95 20:03:06 PST) - Re: Factorisation and Discrete Logs (was Re: EE Times on PRZ) - Derek Atkins <warlord@MIT.EDU>
    • 1995-01-19 (Wed, 18 Jan 95 20:50:57 PST) - Re: Factorisation and Discrete Logs - mpd@netcom.com (Mike Duvos)
      • 1995-01-20 (Thu, 19 Jan 95 21:16:42 PST) - Re: Factorisation and Discrete Logs - Brian A. LaMacchia <bal@martigny.ai.mit.edu>