{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:53:19Z","timestamp":1776847999057,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540338512","type":"print"},{"value":"9783540338529","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11745853_12","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T09:18:58Z","timestamp":1144919938000},"page":"174-190","source":"Crossref","is-referenced-by-count":20,"title":["An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve"],"prefix":"10.1007","author":[{"given":"An","family":"Commeine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Semaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"E. Canfield","year":"1983","unstructured":"Canfield, E., Erd\u00f6s, P., Pomerance, C.: On a problem of Oppenheim concerning factorisatio umerorum. J.Number Theory\u00a017, 1\u201328 (1983)","journal-title":"J.Number Theory"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"30","author":"D. Coppersmith","year":"1984","unstructured":"Coppersmith, D.: Fast Evaluation of Logarithms in Fields of Characteristic Two. IEEE Transactions on Information Theory IT\u00a030, 587\u2013594 (1984)","journal-title":"IEEE Transactions on Information Theory IT"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00198464","volume":"6","author":"D. Coppersmith","year":"1993","unstructured":"Coppersmith, D.: Modifications to the Number Field Sieve. J. Cryptology\u00a06, 169\u2013180 (1993)","journal-title":"J. Cryptology"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"Coppersmith, D., Odlyzko, A., Schroeppel, R.: Discrete logarithms in GF(p). Algorithmica\u00a01, 1\u201315 (1986)","journal-title":"Algorithmica"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D. Gordon","year":"1993","unstructured":"Gordon, D.: Discrete logarithms in GF(p) using the number field sieve. SIAM Journal of Discrete Mathematics\u00a06, 124\u2013138 (1993)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"72","author":"A. Joux","year":"2003","unstructured":"Joux, A., Lercier, R.: Improvements to the general Number Field Sieve for discrete logarithms in prime fields. Mathematics of Computation\u00a072, 953\u2013967 (2003)","journal-title":"Mathematics of Computation"},{"key":"12_CR7","unstructured":"Joux, A., Lercier, R.: Calcul de logarithmes discrets dans GF(p) \u2014 130 chiffres. In: CRYPTO Mailing List (June 2005)"},{"key":"12_CR8","series-title":"Lecture Notes in Mathematics","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"Lenstra, A., Lenstra, H. (eds.): The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol.\u00a01554. Springer, Heidelberg (1993)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. Lenstra","year":"1987","unstructured":"Lenstra, H.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126, 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1515\/156939203321669546","volume":"13","author":"D. Matyukhin","year":"2003","unstructured":"Matyukhin, D.: On asymptotic complexity of computing discrete logarithms over GF(p). Discrete Mathematics and Applications\u00a013, 27\u201350 (2003)","journal-title":"Discrete Mathematics and Applications"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"McCurley, K.: The discrete logarithm problem. In: Pomerance, C. (ed.) Cryptography and Computational Number Theory. Proc. Symp.Appl.Math., vol.\u00a042, Amer. Math. Soc (1990)","DOI":"10.1090\/psapm\/042\/1095551"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1008350005447","volume":"19","author":"A. Odlyzko","year":"2000","unstructured":"Odlyzko, A.: Discrete logarithms: The past and the future. Designs, Codes and Cryptography\u00a019, 129\u2013145 (2000)","journal-title":"Designs, Codes and Cryptography"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.: Discrete Logarithms and Smooth Polynomials. In: Mullen, G., Shiue, P. (eds.) Finite Fields: Theory, Applications and Algorithms. Contemporary Math, vol.\u00a0168, pp. 269\u2013278. Amer. Math. Soc (1994)","DOI":"10.1090\/conm\/168\/01706"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Advances in Cryptology","author":"A.M. Odlyzko","year":"1985","unstructured":"Odlyzko, A.M.: Discrete logarithms in finite fields and their cryptographic significance. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol.\u00a0209, pp. 224\u2013314. Springer, Heidelberg (1985)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-1-4612-4808-8_29","volume-title":"Open Problems in Communication and Computation","author":"A. Odlyzko","year":"1987","unstructured":"Odlyzko, A.: On the complexity of Computing Discrete Logarithms and Factoring Integers. In: Cover, T., Gopinath, B. (eds.) Open Problems in Communication and Computation, pp. 113\u2013116. Springer, Heidelberg (1987)"},{"key":"12_CR16","first-page":"918","volume":"32","author":"J. Pollard","year":"1978","unstructured":"Pollard, J.: Monte Carlo methods for index computations mod p. Mathematics of Computation\u00a032, 918\u2013924 (1978)","journal-title":"Mathematics of Computation"},{"key":"12_CR17","first-page":"4","volume-title":"[8]","author":"J. Pollard","year":"1993","unstructured":"Pollard, J.: Factoring with cubic integers. In: [8], pp. 4\u201310. Springer, Heidelberg (1993)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/B978-0-12-386870-1.50014-9","volume-title":"Discrete Algorithms and Complexity","author":"C. Pomerance","year":"1987","unstructured":"Pomerance, C.: Fast, rigorous factorization and discrete logarithm algorithms. In: Nozaki, N., Johnson, D., Nishizaki, T., Wilf, H. (eds.) Discrete Algorithms and Complexity, pp. 119\u2013143. Academic Press, London (1987)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O. Schirokauer","year":"1993","unstructured":"Schirokauer, O.: Discrete logarithms and local units. Philosophical Transactions of the Royal Society of London (A)\u00a0345, 409\u2013423 (1993)","journal-title":"Philosophical Transactions of the Royal Society of London (A)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.jalgor.2004.11.004","volume":"57","author":"O. Schirokauer","year":"2005","unstructured":"Schirokauer, O.: Virtual Logarithms. Journal of Algorithms\u00a057, 140\u2013147 (2005)","journal-title":"Journal of Algorithms"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1090\/S0025-5718-00-01308-9","volume":"71","author":"I. Semaev","year":"2002","unstructured":"Semaev, I.: Special prime numbers and discrete logs in prime finite fields. Mathematics of Computation\u00a071, 363\u2013377 (2002)","journal-title":"Mathematics of Computation"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1090\/S0025-5718-1992-1106981-9","volume":"58","author":"V. Shoup","year":"1992","unstructured":"Shoup, V.: Searching for primitive roots in finite fields. Mathematics of Computation\u00a058, 918\u2013924 (1992)","journal-title":"Mathematics of Computation"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P. Oorschot van","year":"1999","unstructured":"van Oorschot, P., Wiener, M.: Parallel collision search with cryptanalytic applications. J. Cryptology\u00a012, 1\u201328 (1999)","journal-title":"J. Cryptology"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D. Wiedemann","year":"1986","unstructured":"Wiedemann, D.: Solving sparse linear equations over finite fields. IEEE Trans.Inform. Theory\u00a032, 54\u201362 (1986)","journal-title":"IEEE Trans.Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T02:03:56Z","timestamp":1683425036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11745853_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}