{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:53:22Z","timestamp":1776848002323,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642552199","type":"print"},{"value":"9783642552205","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55220-5_1","type":"book-chapter","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T07:47:50Z","timestamp":1398844070000},"page":"1-16","source":"Crossref","is-referenced-by-count":131,"title":["A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic"],"prefix":"10.1007","author":[{"given":"Razvan","family":"Barbulescu","sequence":"first","affiliation":[]},{"given":"Pierrick","family":"Gaudry","sequence":"additional","affiliation":[]},{"given":"Antoine","family":"Joux","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Thom\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-04873-4_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2013","author":"G. Adj","year":"2014","unstructured":"Adj, G., et al.: Weakness of \n                    \n                      \n                    \n                    $\\mathbb{F}_{3^{6 \\cdot 509}}$\n                   for discrete logarithm cryptography. In: Cao, Z., Zhang, F. (eds.) Pairing 2013. LNCS, vol.\u00a08365, pp. 20\u201344. Springer, Heidelberg (2014)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.: A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In: 20th Annual Symposium on Foundations of Computer Science, pp. 55\u201360. IEEE (1979)","DOI":"10.1109\/SFCS.1979.2"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-58691-1_48","volume-title":"Algorithmic Number Theory","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: The function field sieve. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 108\u2013121. Springer, Heidelberg (1994)"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/0605029","volume":"5","author":"I.F. Blake","year":"1984","unstructured":"Blake, I.F., Fuji-Hara, R., Mullin, R.C., Vanstone, S.A.: Computing logarithms in finite fields of characteristic two. SIAM J. Alg. Disc. Meth.\u00a05(2), 276\u2013285 (1984)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"1_CR5","unstructured":"Cheng, Q., Wan, D., Zhuang, J.: Traps to the BGJT-algorithm for discrete logarithms. Cryptology ePrint Archive, Report 2013\/673 (2013), \n                    \n                      http:\/\/eprint.iacr.org\/2013\/673\/"},{"issue":"4","key":"1_CR6","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\u00a030(4), 587\u2013594 (1984)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"1_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR8","unstructured":"G\u00f6loglu, F., Granger, R., McGuire, G., Zumbr\u00e4gel, J.: Discrete logarithm in GF(21971) (February 2013), Announcement to the NMBRTHRY list"},{"key":"1_CR9","unstructured":"G\u00f6loglu, F., Granger, R., McGuire, G., Zumbr\u00e4gel, J.: Discrete logarithm in GF(26120) (April 2013), Announcement to the NMBRTHRY list"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-40084-1_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"F. G\u00f6lo\u011flu","year":"2013","unstructured":"G\u00f6lo\u011flu, F., Granger, R., McGuire, G., Zumbr\u00e4gel, J.: On the Function Field Sieve and the Impact of Higher Splitting Probabilities. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 109\u2013128. Springer, Heidelberg (2013)"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D.M. Gordon","year":"1993","unstructured":"Gordon, D.M.: Discrete logarithms in GF(p) using the number field sieve. SIAM Journal on Discrete Mathematics\u00a06(1), 124\u2013138 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1_CR12","unstructured":"Joux, A.: Discrete logarithm in GF(21778) (February 2013), Announcement to the NMBRTHRY list"},{"key":"1_CR13","unstructured":"Joux, A.: Discrete logarithm in GF(24080) (March 2013), Announcement to the NMBRTHRY list"},{"key":"1_CR14","unstructured":"Joux, A.: Discrete logarithm in GF(26168) (May 2013), Announcement to the NMBRTHRY list"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-38348-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"A. Joux","year":"2013","unstructured":"Joux, A.: Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 177\u2013193. Springer, Heidelberg (2013)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Joux, A.: A new index calculus algorithm with complexity L(1\/4\u2009+\u2009o(1)) in very small characteristic. Cryptology ePrint Archive, Report 2013\/095 (2013)","DOI":"10.1007\/978-3-662-43414-7_18"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11761679_16","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"A. Joux","year":"2006","unstructured":"Joux, A., Lercier, R.: The function field sieve in the medium prime case. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 254\u2013270. Springer, Heidelberg (2006)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11818175_19","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A. Joux","year":"2006","unstructured":"Joux, A., Lercier, R., Smart, N., Vercauteren, F.: The number field sieve in the medium prime case. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 326\u2013344. Springer, Heidelberg (2006)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BFb0054865","volume-title":"Algorithmic Number Theory","author":"D. Panario","year":"1998","unstructured":"Panario, D., Gourdon, X., Flajolet, P.: An analytic approach to smooth polynomials over finite fields. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 226\u2013236. Springer, Heidelberg (1998)"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic signifiance. IEEE Transactions on Information Theory\u00a024(1), 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR21","unstructured":"Stinson, D.R.: Combinatorial designs: constructions and analysis. Springer (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55220-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T14:20:50Z","timestamp":1558880450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55220-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642552199","9783642552205"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55220-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}