1. Babai, L., Szemerédi, E.: On the complexity of matrix group problems I. In: Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, Singer Island FL, pp. 229–240. IEEE Computer Society Press, Los Alamitos (1984); ISBN 0-8186-0591-X. ISSN 0272-5428
2. Lecture Notes in Computer Science;D. Boneh,1996
3. Lecture Notes in Computer Science;U. Maurer,1998
4. Maurer, U.M., Wolf, S.: The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM Journal on Computing 28(5), 1689–1721 (1999)
5. Nechaev, V.I.: К вопросу о сложности детерминировaнного aлгоритмa для дискретного логарифма. Российская Академия Наук. Математические Заметки 55(2), 91–101, 189 (1994) ISSN 0025-567X; Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes 55(2), 165–172 (1994)