On polynomial approximation and the parallel complexity of the discrete logarithm problem and breaking the DiffieHellman cryptosystem, preprint (1996)

by D Coppersmith, I E Shparlinsky