{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:39Z","timestamp":1772283579603,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540577669","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48329-2_13","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:25:55Z","timestamp":1186349155000},"page":"147-158","source":"Crossref","is-referenced-by-count":21,"title":["A Subexponential Algorithm for Discrete Logarithms over All Finite Fields"],"prefix":"10.1007","author":[{"given":"Leonard M.","family":"Adleman","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"DeMarrais","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Adleman L.M., A subexponential algorithm for discrete logarithms with applications to cryptography. Proc. 20th IEEE Found. Comp. Sci. Symp. 1979, pp. 55\u201360.","DOI":"10.1109\/SFCS.1979.2"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Adleman L.M., Factoring numbers using singular integers, Proc. 23rd Annual ACM Symposium on Theory of Computing, 1991. pp. 64\u201371.","DOI":"10.1145\/103418.103432"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Adleman L.M. and Huang M., Primality Testing and Abelian Varieties Over Finite Fields, Lecture Notes In Mathematics 1512, Springer-Verlag, 1992.","DOI":"10.1007\/BFb0090185"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Adleman L.M. and Lenstra H.W. Jr., Finding irreducible polynomials over finite fields. Proc. 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 350\u2013355.","DOI":"10.1145\/12130.12166"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"713","DOI":"10.2307\/2004849","volume":"24","author":"E. Berlekamp","year":"1970","unstructured":"Berlekamp E., Factoring polynomials over large finite fields. Math. Comp. 24, 1970. pp. 713\u2013735.","journal-title":"Math. Comp."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bach E. and Shallit J., Factoring with cyclotomic polynomials. Proc. 26th IEEE Found. Comp. Sci. Symp. 1985, pp. 443\u2013450.","DOI":"10.1109\/SFCS.1985.24"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"E.R. Canfield","year":"1983","unstructured":"Canfield E.R., Erd\u00f6s P. and Pomerance C, On a problem of Oppenhiem concerning \u201cFactorisatio Nemerorum\u201d. J. Number Theory, 17, 1983 pp. 1\u201328.","journal-title":"J. Number Theory"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"IT-30","author":"D. Coppersmith","year":"1984","unstructured":"Coppersmith D., Fast Evaluation of Logarithms in Fields of Characteristic Two. IEEE Trans on Information Theory, vol IT-30, No 4, July 1984, pp. 587\u2013594.","journal-title":"IEEE Trans on Information Theory"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"Coppersmith D., Odlyzko A.M. and Schroeppel R., Discrete logarithms in GF(p), Algorithmica, v. 1, 1986, pp 1\u201315.","journal-title":"Algorithmica"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie W. and Hellman M.E., New Directions in Cryptography, IEEE Trans. Inform Theory, vol IT-22, pp 644\u2013654, 1976","journal-title":"IEEE Trans. Inform Theory"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Edwards H.M., Fermat\u2019s Last Theorem, Graduate Texts in Mathematics 50, Springer-Verlag, 1977.","DOI":"10.1007\/978-1-4684-9307-8"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal T., A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Info. Theory, vol IT-31 pp. 469\u2013472, 1985","journal-title":"IEEE Trans. Info. Theory"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/TIT.1985.1057075","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal T., A subexponential-time algorithm for computing discrete logarithms over GF(p 2), IEEE Trans. Info. Theory, vol IT-31 pp. 473\u2013481, 1985","journal-title":"IEEE Trans. Info. Theory"},{"key":"13_CR14","unstructured":"Gauss K.P., Disquisitiones Arithmeticae, translation A.C. Clarke, S.J., Yale University Press, 1966."},{"key":"13_CR15","unstructured":"Gordon D.M., Discrete logarithms in GF(p) using the number field sieve, manuscript, April 4, 1990."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Hellman M. E., Reyneri J. M. Fast computation of discrete logarithms in GF(q). Advances in Cryptography: Proceedings of CRYPTO\u2019 82, pp. 3\u201313","DOI":"10.1007\/978-1-4757-0602-4_1"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.2307\/2008545","volume":"56","author":"H.W. Lenstra Jr.","year":"1991","unstructured":"Lenstra H.W. Jr., Finding isomorphisms between finite fields. Math Comp 56, 1991, pp. 329\u2013347.","journal-title":"Math Comp"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"Lenstra H.W. Jr., Factoring integers with elliptic curves. Ann. of Math. 126, 1987, pp. 649\u2013673.","journal-title":"Ann. of Math."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Lenstra A.K., Lenstra H.W., Jr., Manasse M.S. and Pollard J.M. The number field sieve. Proc. 22nd STOC, 1990, pp. 564\u2013572.","DOI":"10.1145\/100216.100295"},{"key":"13_CR20","unstructured":"Lovorn R., Rigorous, subexponenial algorithms for discrete logarithms over finite fields, PhD Thesis, University of Georgia, May 1992"},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1090\/pspum\/008\/0180544","volume":"VIII","author":"M. Newman","year":"1965","unstructured":"Newman M., Bounds for class numbers, Proc. Sympos. Pure Math. American Mathematics Society, Vol. VIII, 1965, pp 70\u201377.","journal-title":"Proc. Sympos. Pure Math."},{"key":"13_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Proceedings of Eurocrypt\u2019 84","author":"A. M. Odlyzko","year":"1985","unstructured":"Odlyzko A. M., Discrete Logarithms in Finite Fields and their Cryptographic Significance, Proceedings of Eurocrypt\u2019 84, Lecture Notes in Computer Science, Springer-Verlag. 1985. pp. 224\u2013314."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Pomerance C. Fast, rigorous factorization and discrete logarithms, Discrete Algorithms and Complexity. ED. Johnson D.S., Nishizeki T., Nozaki A. and Wilf H.S. Academic Press, 1987. pp. 119\u2013144.","DOI":"10.1016\/B978-0-12-386870-1.50014-9"},{"issue":"2","key":"13_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. O. Rabin","year":"1980","unstructured":"Rabin M. O., Probabilistic Algorithms in Finite Fields. SIAM Journal of Computing, Vol 9, No 2, May 1980, pp. 273\u2013280","journal-title":"SIAM Journal of Computing"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"Solovay R. and Strassen V., A fast Monte-Carlo test for primality. Siam Journal of Computing 6, 1977. pp. 84\u201385.","journal-title":"Siam Journal of Computing"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Washington L.C., Introduction to Cyclotomic Fields, Graduate Texts in Mathematics 83, Springer-Verlag, 1982.","DOI":"10.1007\/978-1-4684-0133-2"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Wiedermann D. Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory. IT-32, pp. 54\u201362","DOI":"10.1109\/TIT.1986.1057137"},{"key":"13_CR28","unstructured":"Western A.E. and Miller J.C.P., Tables of Indices and Primitive Roots, Royal Society Mathematical Tables, vol. 9., Cambridge University Press, 1968."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:31Z","timestamp":1605629731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540577669"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_13","relation":{},"subject":[]}}