S. Pohlig and M. Hellman. An improved algorithm for computing discrete logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106--110, 1978. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Searching for Elements in Black Box Fields and Applications - Boneh, Lipton (1996) (3 citations) (Correct)
Algorithms for Quantum Computation: Discrete Logarithms and.. - Shor (1994) (156 citations) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC