{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:52Z","timestamp":1772283652064,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662434130","type":"print"},{"value":"9783662434147","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43414-7_7","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T14:57:06Z","timestamp":1400597826000},"page":"136-152","source":"Crossref","is-referenced-by-count":14,"title":["Solving a $$6120$$ -bit DLP on a Desktop Computer"],"prefix":"10.1007","author":[{"given":"Faruk","family":"G\u00f6lo\u011flu","sequence":"first","affiliation":[]},{"given":"Robert","family":"Granger","sequence":"additional","affiliation":[]},{"given":"Gary","family":"McGuire","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Zumbr\u00e4gel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,21]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"PSLM Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., \u00d3\u2019 h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptogr. 42(3), 239\u2013271 (2007)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.ffa.2003.08.004","volume":"10","author":"AW Bluher","year":"2004","unstructured":"Bluher, A.W.: On $$x^{q+1}+ax+b$$ . Finite Fields Appl. 10(3), 285\u2013305 (2004)","journal-title":"Finite Fields Appl."},{"issue":"3\u20134","key":"7_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The magma algebra system. I. The user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"issue":"1\u20133","key":"7_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e9re","year":"1999","unstructured":"Faug\u00e9re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases $$(F_4)$$ . J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P Gaudry","year":"2002","unstructured":"Gaudry, P., Hess, F., Smart, N.P.: Constructive and destructive facets of weil descent on elliptic curves. J. Cryptol. 15(1), 19\u201346 (2002)","journal-title":"J. Cryptol."},{"key":"7_CR6","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-40084-1_7","volume-title":"CRYPTO 2013, Part II","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: application to discrete logarithms in $${\\mathbb{F}}_{2^{1971}}$$ and $${\\mathbb{F}}_{2^{3164}}$$ . In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 109\u2013128. Springer, Heidelberg (2013)"},{"key":"7_CR7","unstructured":"G\u00f6lo\u011flu, F., Granger, R., McGuire, G., Zumbr\u00e4gel, J.: Discrete Logarithms in $$GF(2^{1971})$$ . NMBRTHRY list, 19 Feb 2013"},{"key":"7_CR8","unstructured":"G\u00f6lo\u011flu, F., Granger, R., McGuire, G., Zumbr\u00e4gel, J.: Discrete Logarithms in $$GF(2^{6120})$$ . NMBRTHRY list, 11 Apr 2013"},{"key":"7_CR9","unstructured":"Granlund, T.: The GMP development team: GNU MP: The GNU Multiple Precision Arithmetic Library, 5.0.5 edn. http:\/\/gmplib.org\/ (2012)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s12095-009-0018-y","volume":"2","author":"T Helleseth","year":"2010","unstructured":"Helleseth, T., Kholosha, A.: $$x^{{2^l}+1}+x+a$$ and related affine polynomials over $${}(2^k)$$ . Cryptogr. Commun. 2(1), 85\u2013109 (2010)","journal-title":"Cryptogr. Commun."},{"key":"7_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-38348-9_11","volume-title":"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. 7881, pp. 177\u2013193. Springer, Heidelberg (2013)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Joux, A.: A new index calculus algorithm with complexity $$L(1\/4+o(1))$$ in very small characteristic. Cryptology ePrint Archive, report 2013\/095. http:\/\/eprint.iacr.org\/ (2013)","DOI":"10.1007\/978-3-662-43414-7_18"},{"key":"7_CR13","unstructured":"Joux, A.: Personal communication (2013)"},{"key":"7_CR14","unstructured":"Joux, A.: Discrete Logarithms in $$GF(2^{1778})$$ . NMBRTHRY list, 11 Feb 2013"},{"key":"7_CR15","unstructured":"Joux, A.: Discrete Logarithms in $$GF(2^{4080})$$ . NMBRTHRY list, 22 Mar 2013"},{"key":"7_CR16","unstructured":"Joux, A.: Discrete Logarithms in $$GF(2^{6168})$$ . NMBRTHRY list, 21 May 2013"},{"key":"7_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11761679_16","volume-title":"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. 4004, pp. 254\u2013270. Springer, Heidelberg (2006)"},{"key":"7_CR18","series-title":"LNCS","first-page":"109","volume-title":"CRYPTO 1990","author":"BA LaMacchia","year":"1991","unstructured":"LaMacchia, B.A., Odlyzko, A.M.: Solving large sparse linear systems over finite fields. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 109\u2013133. Springer, Heidelberg (1991)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stan. 45, 255\u2013282 (1950)","journal-title":"J. Res. Nat. Bur. Stan."},{"key":"7_CR20","series-title":"LNM","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr, H.W. (eds.): The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Heidelberg (1993)"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra Jr","year":"1987","unstructured":"Lenstra Jr, H.W.: Factoring integers with elliptic curves. Ann. Math. (2) 126(3), 649\u2013673 (1987)","journal-title":"Ann. Math. (2)"},{"issue":"193","key":"7_CR22","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1090\/S0025-5718-1991-1052099-2","volume":"56","author":"HW Lenstra Jr","year":"1991","unstructured":"Lenstra Jr, H.W.: Finding isomorphisms between finite fields. Math. Comp. 56(193), 329\u2013347 (1991)","journal-title":"Math. Comp."},{"key":"7_CR23","unstructured":"Popovyan, I.: Efficient parallelization of lanczos type algorithms. Cryptology ePrint Archive, Report 2011\/416. http:\/\/eprint.iacr.org\/ (2011)"},{"key":"7_CR24","unstructured":"Shoup, V.: NTL: A library for doing number theory, 5.5.2 edn. http:\/\/www.shoup.net\/ntl\/ (2009)"},{"key":"7_CR25","unstructured":"Spaenlehauer, P.J.: Solving multihomogeneous and determinantal systems algorithms - complexity - applications. Ph.D. thesis, Universit\u00e9 Pierre et Marie Curie (UPMC) (2012)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography -- SAC 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43414-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:29:14Z","timestamp":1649021354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43414-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662434130","9783662434147"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43414-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}