REFERENCES
L. M. ADELMAN, “A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography,” Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science, New York, 1979, pp. 55–60.
A. K. LENSTRA AND H. W. LENSTRA, JR, The Development of the Number Field Sieve, Lecture Notes in Mathematics #1554, Springer-Verlag, New York, NY, 1993.
A. M. ODLYZKO, “Discrete Logarithms: The Past and the Future,” Designs, Codes, and Cryptography, 19, 129–145 (1999).
W. WESLEY PETERSON AND E. J. WELDON, Error-Correcting Codes Revised 2nd edn., The M.I.T Press, Cambridge, Massachusetts, 1972.
S. POHLIG AND M. HELLMAN, “An Improved Method for Computing Logarithms Over GF(p) and its Cryptographic Significance,” IEEE Transactions on Information Theory, IT-24, 107–110 (1978).
J. M. POLLARD, “Monte Carlo Methods for Index Computation Mod p,” Mathematics of Computation, 32, 918–924 (1978).
D. SHANKS, Solved and Unsolved Problems in Number Theory, Chealsea Publishing Spartan Books (New York, NY), 1962.
P. W. SHOR, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” SIAM Journal of Computing, 26, 1484–1509 (1997).
Computer Security and Cryptography. By Alan G. KonheimCopyright © 2007 John Wiley & Sons, Inc.
Get Computer Security and Cryptography now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
