{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:53:20Z","timestamp":1776848000534,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_18","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T14:57:06Z","timestamp":1400597826000},"page":"355-379","source":"Crossref","is-referenced-by-count":59,"title":["A New Index Calculus Algorithm with Complexity $$L(1\/4+o(1))$$ in Small Characteristic"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Joux","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,21]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1006\/inco.1998.2761","volume":"151","author":"LM Adleman","year":"1999","unstructured":"Adleman, L.M., Huang, M.-D.A.: Function field sieve method for discrete logarithms over finite fields. Inf. Comput. 151, 5\u201316 (1999). (Academic Press)","journal-title":"Inf. Comput."},{"key":"18_CR2","first-page":"197","volume":"2013","author":"R Barbulescu","year":"2013","unstructured":"Barbulescu, R., Bouvier, C., Detrey, J., Gaudry, P., Jeljeli, H., Thom\u00e9, E., Videau, M., Zimmermann, P.: Discrete logarithm in GF(\n                      \n                        \n                      \n                      $$2^{809}$$\n                    ) with FFS. IACR Cryptol. ePrint Arch. 2013, 197 (2013)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inf. Theor. IT-30(4), 587\u2013594 (1984)","DOI":"10.1109\/TIT.1984.1056941"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jsc.2010.10.014","volume":"46","author":"J-C Faug\u00e8re","year":"2011","unstructured":"Faug\u00e8re, J.-C., Din, M.S.E., Spaenlehauer, P.-J.: Gr\u00f6bner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): algorithms and complexity. J. Symbolic Comput. 46(4), 406\u2013437 (2011)","journal-title":"J. Symbolic Comput."},{"key":"18_CR5","first-page":"74","volume":"2013","author":"F G\u00f6loglu","year":"2013","unstructured":"G\u00f6loglu, 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 \n                      \n                        \n                      \n                      $${2^{1971}}$$\n                    . IACR Cryptol. ePrint Arch. 2013, 74 (2013)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"18_CR6","first-page":"306","volume":"2013","author":"F G\u00f6loglu","year":"2013","unstructured":"G\u00f6loglu, F., Granger, R., McGuire, G., Zumbr\u00e4gel, J.: Solving a 6120-bit DLP on a desktop computer. IACR Cryptol. ePrint Arch. 2013, 306 (2013)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"18_CR7","unstructured":"Huang, M.-D., Narayanan, A.K.: Finding primitive elements in finite fields of small characteristic. CoRR abs\/1304.1206 (2013)"},{"key":"18_CR8","unstructured":"Joux, A.: Discrete logarithms in GF(\n                      \n                        \n                      \n                      $$2^{4080}$$\n                    ). NMBRTHRY list, March 2013"},{"key":"18_CR9","unstructured":"Joux, A.: Discrete logarithms in GF(\n                      \n                        \n                      \n                      $$2^{6168}$$\n                    ) = GF(\n                      \n                        \n                      \n                      $$(2^{257})^{24}$$\n                    ). NMBRTHRY list, May 2013"},{"key":"18_CR10","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":"18_CR11","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":"18_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11818175_19","volume-title":"CRYPTO 2006","author":"A Joux","year":"2006","unstructured":"Joux, A., Lercier, R., Smart, N.P., Vercauteren, F.: The number field sieve in the medium prime case. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 326\u2013344. Springer, Heidelberg (2006)"},{"key":"18_CR13","series-title":"LNCS","first-page":"226","volume-title":"ANTS 1998","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. 1423, pp. 226\u2013236. Springer, Heidelberg (1998)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1090\/S0025-5718-98-00969-7","volume":"67","author":"I Semaev","year":"1998","unstructured":"Semaev, I.: An algorithm for evaluation of discrete logarithms in some nonprime finite fields. Math. Comput. 67, 1679\u20131689 (1998)","journal-title":"Math. Comput."},{"key":"18_CR15","unstructured":"Spaenlehauer, P.-J.: Solving multi-homogeneous 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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:50:39Z","timestamp":1558907439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43414-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662434130","9783662434147"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43414-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}