{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:20:35Z","timestamp":1753888835102},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648925"},{"type":"electronic","value":"9783540684626"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055747","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T17:12:36Z","timestamp":1154020356000},"page":"458-471","source":"Crossref","is-referenced-by-count":27,"title":["The solution of McCurley's discrete log challenge"],"prefix":"10.1007","author":[{"given":"Damian","family":"Weber","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Denny","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"unstructured":"I. Biehl and J. Buchmann and Th. Papanikolaou. LiDIA \u2014 a library for computational number theory. Technical report, Universit\u00e4t des Saarlandes\/Germany, 1995. http:\/\/www.informatik.th-darmstadt.de\/TI\/LiDIA","key":"32_CR1"},{"unstructured":"Th. F, Denny. L\u00f6sen grosser d\u00fcnnbesetzter Gleichungssysteme \u00fcber endlichen Primk\u00f6rpern. PhD thesis, Universit\u00e4t des Saarlandes\/Germany, 1997.","key":"32_CR2"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman. New directions in cryptography. IEEE Trans. Information Theory 22, pages pp. 472\u2013492, 1976.","journal-title":"IEEE Trans. Information Theory"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Information Theory, 31:469\u2013472, 1985.","journal-title":"IEEE Trans. Information Theory"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D. Gordon","year":"1993","unstructured":"D. Gordon. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math., 6:124\u2013138, 1993.","journal-title":"SIAM J. Discrete Math."},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(76)90050-5","volume":"3","author":"D. E. Knuth","year":"1976","unstructured":"D. E. Knuth and L. Trabb Pardo. Analysis of a simple factorization algorithm. Theoretical Computer Science, 3:321\u2013348, 1976.","journal-title":"Theoretical Computer Science"},{"key":"32_CR7","first-page":"109","volume":"number 537","author":"M. LaMacchia","year":"1990","unstructured":"M. LaMacchia and A. Odlyzko. Solving large sparse linear systems over finite fields. In Advances in Cryptology \u2014 Crypto '90, number 537 in Lecture Notes in Computer Science, pages 109\u2013133, 1990.","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF00123958","volume":"1","author":"M. LaMacchia","year":"1991","unstructured":"M. LaMacchia and A. Odlyzko. Computation of discrete logarithms in prime fields. Designs, Codes and Cryptography, 1:46\u201362, 1991.","journal-title":"Designs, Codes and Cryptography"},{"doi-asserted-by":"crossref","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr. (eds.). The development of the number field sieve. Number 1554 in Lecture Notes in Mathematics. Springer, 1993.","key":"32_CR9","DOI":"10.1007\/BFb0091534"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. W. Lenstra Jr.","year":"1987","unstructured":"H. W. Lenstra, Jr. Factoring integers with elliptic curves. Ann. of Math., 126:649\u2013673, 1987.","journal-title":"Ann. of Math."},{"doi-asserted-by":"crossref","unstructured":"K. S. McCurley. The discrete logarithm problem. In Cryptology and Computational Number Theory, number 42 in Proc. Symp. in Applied Mathematics, pages 49\u201374. American Mathematical Society, 1990.","key":"32_CR11","DOI":"10.1090\/psapm\/042\/1095551"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P. L. Montgomery","year":"1985","unstructured":"P. L. Montgomery. Modular multiplication without trial division. Math. Comp., 44:519\u2013521, 1985.","journal-title":"Math. Comp."},{"unstructured":"V. M\u00fcller and Th. F. Denny. On the reduction of composed relations from the number field sieve. In H. Cohen, editor, Algorithmic Number Theory \u2014 ANTS II, number 1122 in Lecture Notes in Computer Science, 1996.","key":"32_CR13"},{"unstructured":"National Bureau of Standards. Digital signature standard, 1994. FIPS Publication 186.","key":"32_CR14"},{"doi-asserted-by":"crossref","unstructured":"J. M. Pollard. The lattice sieve. Number 1554 in Lecture Notes in Mathematics. Springer, 1993.","key":"32_CR15","DOI":"10.1007\/BFb0091538"},{"key":"32_CR16","first-page":"99","volume":"37","author":"C. Pomerance","year":"1983","unstructured":"C. Pomerance and S. S. Wagstaff. Implementation of the continued fraction integer factoring algorithm. In Proc.12th Manitoba Conf., Winnipeg\/Manitoba 1982, Congr. Numerantium, volume 37 of Numerical mathematics and computing, pages 99\u2013118, 1983.","journal-title":"Numerical mathematics and computing"},{"key":"32_CR17","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O. Schirokauer","year":"1993","unstructured":"O. Schirokauer. Discrete logarithms and local units. Phil. Trans. R. Soc. Lond. A 345, pages 409\u2013423, 1993.","journal-title":"Phil. Trans. R. Soc. Lond. A"},{"doi-asserted-by":"crossref","unstructured":"O. Schirokauer, D. Weber, and Th. F. Denny. Discrete logarithms: the effectiveness of the index calculus method. In H. Cohen, editor, Algorithmic Number Theory \u2014 ANTS II, number 1122 in Lecture Notes in Computer Science, 1996.","key":"32_CR18","DOI":"10.1007\/3-540-61581-4_66"},{"unstructured":"D. Shanks. Solved and unsolved problems in number theory (3rd ed.). Chelsea Publishing Company, 1985.","key":"32_CR19"},{"doi-asserted-by":"crossref","unstructured":"D. Weber. Computing discrete logarithms with quadratic number rings. In Eurocrypt'98, Lecture Notes in Computer Science, 1998. To appear.","key":"32_CR20","DOI":"10.1007\/BFb0054125"},{"doi-asserted-by":"crossref","unstructured":"D. Weber. Computing discrete logarithms with the number field sieve. In H. Cohen, editor, Algorithmic Number Theory \u2014 ANTS II, number 1122 in Lecture Notes in Computer Science, 1996.","key":"32_CR21","DOI":"10.1007\/3-540-61581-4_70"},{"key":"32_CR22","volume-title":"PhD thesis","author":"D. Weber","year":"1997","unstructured":"D. Weber. On the computation of discrete logarithms in finite prime fields. PhD thesis, Universit\u00e4t des Saarlandes\/Germany, 1997."},{"doi-asserted-by":"crossref","unstructured":"D. Weber. An implementation of the number field sieve to compute discrete logarithms mod p. Advances in Cryptology \u2014 Eurocrypt'95. number 921 in Lecture Notes in Computer Science, 1995.","key":"32_CR23","DOI":"10.1007\/3-540-49264-X_8"},{"key":"32_CR24","volume-title":"PhD thesis","author":"J. Zayer","year":"1995","unstructured":"J. Zayer. Faktorisieren mit dem Number Field Sieve. PhD thesis, Universit\u00e4t des Saarlandes\/Germany, 1995."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T05:08:54Z","timestamp":1555736934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648925","9783540684626"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0055747","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}