1. L. M. Adleman (1979): A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proc. 20th IEEE Symp. Foundations of Computer Science, pp. 55–60
2. L. M. Adleman, J. DeMarrais (1993): A subexponential algorithm for discrete logarithms over all finite fields, Math. Comp. 61, 1–15
3. M. Ajtai, C. Dwork (1997): A public-key cryptosystem with worst-case/average-case equivalence. 29th ACM Symp. Theory of Computing, pp. 284–293
4. K. Araki, T. Satoh (1998): Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Comm. Math. Univ. Santi Pauli 47, 81–92
5. E. Bach, J. Shallit (1996): Algorithmic Number Theory, vol. 1. MIT Press