1. L. Adleman, A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography, Proc. 20th IEEE Foundations of Computer Science Symposium (1979). 55–50.
2. D. Coppersmith. Fast Evaluation of Logarithms in Fields of Characteristic two, IEEE Transactions on Information Theory IT-30 (1964), 587–594.
3. W. Diffie and M. Hellman. New Directions in Cryptography, IEEE Transactions on Information Theory, IT-22 (1976). 472–492.
4. T. ElGamal. A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2). submitted to IEEE Transactions on Information Theory.
5. A. Odlyzko. Discrete Logarithms in Finite Fields and Their Cryptographic Significance. to appear in Proceedings of Eurocrypt’ 84.