The discrete logarithm problem in GL(n, q)

Ars Combinatoria

Volumn 47, Issue , 1997, Pages 23-32

  Menezes, Alfred J ^a   Wu, Yi Hong ^a  

^a AUBURN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012085380     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. L. Adleman and J. DeMarrais, "A subexponential algorithm for discrete logarithms over all finite fields", Mathematics of Computation, 61 (1993), 1-15.
2. M. Ben-Or, "Probabilistic algorithms in finite fields", 22nd Annual Symposium on Foundations of Computer Science, 394-398, 1981.
3. J. Buchmann and H. Williams, "A key-exchange system based on imaginary quadratic fields" Journal of Cryptology, 1 (1988), 107-118.
4. H. Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag, Berlin, 1993.
5. D. Coppersmith, A. Odlyzko and R. Schroeppel, "Discrete logarithms in GF(p)", Algorithmica, 1 (1986), 1-15.
6. W. Diffie and M. Hellman, "New directions in cryptography", IEEE Transactions on Information Theory, 22 (1976), 644-654.
7. R. Horn and C. Johnson, Matrix Analysis, Cambridge University Press, 1985.
8. N. Koblitz, "Elliptic curve cryptosystems", Mathematics of Computation, 48 (1987), 203-209.
9. N. Koblitz, "Hyperelliptic cryptosystems", Journal of Cryptology, 1 (1989), 139-150.
10. K. McCurley, "The discrete logarithm problem", Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics, 42 (1990), 49-74.
11. A. Menezes and S. Vanstone, "A note on cyclic groups, finite fields, and the discrete logarithm problem", Applicable Algebra in Engineering, Communication and Computing, 3 (1992), 67-74.
12. V. Miller, "Uses of elliptic curves in cryptography", Advances in Cryptology - Proceedings of Crypto '85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417-426.
13. I. Niven, "Fermat's theorem for matrices", Duke Mathematical Journal, 15 (1948), 823-826.
14. A. Odlyzko, "Discrete logarithms in finite fields and their cryptographic significance", Advances in Cryptology - Proceedings of Eurocrypt '84, Lecture Notes in Computer Science, 209 (1985), Springer- Verlag, 224-314.
15. R. Odoni, V. Varadharajan and R. Sanders, "Public key distribution in matrix rings", Electronics Letters, 20 (1984), 386-387.
16. J. Rosser and L. Schoenfeld, "Approximate formulas for some functions of prime numbers", Illinois Journal of Mathematics, 6 (1962), 64-94.