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

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