From: Hal <hfinney@shell.portal.com>
Date: Wed, 18 Jan 95 21:04:22 PST
To: cypherpunks@toad.com
Subject: Re:  Factorisation and Discrete Logs (was Re: EE Times on PRZ)
Message-ID: <199501190504.VAA03998@jobe.shell.portal.com>
MIME-Version: 1.0
Content-Type: text/plain


From: dwa@mirage.svl.trw.com (Dana Albrecht)
> Choose, at random, "a" such that gcd(a,N) = 1.
> 
> Compute x such that:
> 
>      a^x = 1 (mod N)          [ Discrete log time! ]

DH uses prime moduli, I believe.  Solving the DL problem sufficiently to
break DH may not let you solve it for composite moduli, not without
knowing the factors.

Hal