{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:17:25Z","timestamp":1648963045622},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T00:00:00Z","timestamp":1513728000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10623-017-0449-y","type":"journal-article","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T01:02:49Z","timestamp":1513731769000},"page":"2279-2314","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The point decomposition problem over hyperelliptic curves"],"prefix":"10.1007","volume":"86","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Wallet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,20]]},"reference":[{"key":"449_CR1","unstructured":"Bardet M., Faug\u00e8re J.-C., Salvy B.: On the complexity of the $$F5$$ F 5 Gr\u00f6bner basis algorithm. J. Symb. Comput., pp. 1\u201324 (2014)."},{"issue":"3\u20134","key":"449_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). Computational algebra and number theory (London, 1993).","journal-title":"J. Symb. Comput."},{"key":"449_CR3","unstructured":"Bouvier C.: The filtering step of discrete logarithm and integer factorization algorithms. Preprint. http:\/\/hal.inria.fr\/hal-00734654 (2013)."},{"key":"449_CR4","unstructured":"Byramjee B., Duquesne S.: Classification of genus 2 curves over $${\\cal{F}}_{2}^{n}$$ F 2 n and optimization of their arithmetic. Cryptology ePrint Archive, Report 2004\/107 (2004)."},{"key":"449_CR5","unstructured":"Choie Y., Yun D.: Isomorphism classes of hyperelliptic curves of genus $$2$$ 2 over $${\\cal{F}}_{2}^{n}$$ F 2 n . In: Proceedings of the ACISP 2002. LNCS, vol. 2384, pp. 190\u2013202 (2002)."},{"key":"449_CR6","unstructured":"Childers G.: Factorization of a 1061-bit number by the special number field sieve. Cryptology ePrint Archive, Report 2012\/444 (2012)."},{"key":"449_CR7","unstructured":"Chung P.N., Costello C., Smith B.: Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with fast Kummers. SAC (2016)."},{"key":"449_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3\/e (Undergraduate Texts in Mathematics)","author":"DA Cox","year":"2007","unstructured":"Cox D.A., Little J., O\u2019Shea D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3\/e (Undergraduate Texts in Mathematics). Springer, New York (2007)."},{"key":"449_CR9","doi-asserted-by":"crossref","unstructured":"Diem C.: An index calculus algorithm for plane curves of small degree. In :Algorithmic Number Theory. Lecture Notes in Computer Science, vol. 4076, pp. 543\u2013557. Springer, Berlin (2006).","DOI":"10.1007\/11792086_38"},{"key":"449_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1112\/S0010437X10005075","volume":"147","author":"C Diem","year":"2011","unstructured":"Diem C.: On the discrete logarithm problem in elliptic curves. Compositio Mathematica 147, 75\u2013104 (2011).","journal-title":"Compositio Mathematica"},{"issue":"1","key":"449_CR11","first-page":"1","volume":"18","author":"C Diem","year":"2003","unstructured":"Diem C.: The GHS attack in odd characteristic. J. Ramanujan Math. Soc. 18(1), 1\u201332 (2003).","journal-title":"J. Ramanujan Math. Soc."},{"key":"449_CR12","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.-C.: FGb: a library for computing Grb\u00f6ner bases. In: Fukuda K., Hoeven J., Joswig M., Takayama N. (eds.) Mathematical Software ICMS 2010. Lecture Notes in Computer Science, vol. 6327, pp. 84\u201387. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-15582-6_17"},{"issue":"4","key":"449_CR13","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J-C Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re J.-C., Gianni P.M., Lazard D., Mora T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993).","journal-title":"J. Symb. Comput."},{"issue":"1","key":"449_CR14","first-page":"6188","volume":"139","author":"J-C Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139(1), 6188 (1999).","journal-title":"J. Pure Appl. Algebra"},{"key":"449_CR15","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201902 (2002).","DOI":"10.1145\/780506.780516"},{"issue":"4","key":"449_CR16","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s00145-013-9158-5","volume":"27","author":"J-C Faug\u00e8re","year":"2014","unstructured":"Faug\u00e8re J.-C., Gaudry P., Huot L., Renault G.: Using symmetries in the index calculus for elliptic curves discrete logarithm. J. Cryptol. 27(4), 595\u2013635 (2014).","journal-title":"J. Cryptol."},{"key":"449_CR17","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J-C., Huot L., Joux A., Renault G., Vitse V.: Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus. In: Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2014\u201433rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 11\u201315 May, pp. 40\u201357 (2014).","DOI":"10.1007\/978-3-642-55220-5_3"},{"key":"449_CR18","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.C., Mou C.: Fast algorithm for change of ordering of zero-dimensional Gr\u00f6bner bases with sparse multiplication matrices. In: Proceedings of the Symbolic and Algebraic Computation, International Symposium, ISSAC, 2011, Co-located with FCRC, San Jose, CA, USA, 7\u201311 June, pp. 115\u2013122 (2011).","DOI":"10.1145\/1993886.1993908"},{"key":"449_CR19","doi-asserted-by":"crossref","first-page":"1717","DOI":"10.1109\/18.771254","volume":"45","author":"G Frey","year":"1999","unstructured":"Frey G., M\u00fcller M., R\u00fcck H.-G.: The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Trans. Inf. Theory 45, 1717\u20131719 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"449_CR20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10623-015-0146-7","volume":"78\u20131","author":"SD Galbraith","year":"2016","unstructured":"Galbraith S.D., Gaudry P.: Recent progress on the elliptic curve discrete logarithm problem In Des. Codes Cryptogr. 78\u20131, 51\u201372 (2016).","journal-title":"Codes Cryptogr."},{"key":"449_CR21","doi-asserted-by":"crossref","unstructured":"Galbraith S.D., Gebregiyorgis S.W.: Summation polynomial algorithms for elliptic curves in characteristic two. In: Proceedings of the Progress in Cryptology\u2014INDOCRYPT 2014\u201415th International Conference on Cryptology in India, New Delhi, India, 14\u201317 Dec, pp. 409\u2013427 (2014).","DOI":"10.1007\/978-3-319-13039-2_24"},{"issue":"12","key":"449_CR22","doi-asserted-by":"crossref","first-page":"1690","DOI":"10.1016\/j.jsc.2008.08.005","volume":"44","author":"P Gaudry","year":"2009","unstructured":"Gaudry P.: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. J. Symb. Comput. 44(12), 1690\u20131702 (2009).","journal-title":"J. Symb. Comput."},{"key":"449_CR23","doi-asserted-by":"crossref","unstructured":"Gaudry P.: An algorithm for solving the discrete log problem on hyperelliptic curves. In: Advances in Cryptology\u2014EUROCRYPT 2000. Lecture Notes in Computer Science, vol. 1807, pp. 19\u201334. Springer, Berlin (2000).","DOI":"10.1007\/3-540-45539-6_2"},{"key":"449_CR24","first-page":"243","volume":"1\u20133","author":"P Gaudry","year":"2007","unstructured":"Gaudry P.: Fast genus 2 arithmetic based on Theta functions. J. Math. Cryptol. 1\u20133, 243\u2013265 (2007).","journal-title":"J. Math. Cryptol."},{"key":"449_CR25","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.ffa.2008.12.006","volume":"15\u20132","author":"P Gaudry","year":"2009","unstructured":"Gaudry P., Lubicz D.: The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines. Finite Fields Appl. 15\u20132, 246\u2013260 (2009).","journal-title":"Finite Fields Appl."},{"key":"449_CR26","doi-asserted-by":"crossref","unstructured":"Joux A., Vitse V.: Cover and decomposition index calculus on elliptic curves made practical: application to a previously unreachable curve over $${\\cal{F}}_{q}^{6}$$ F q 6 . In: Advances in Cryptology\u2014EUROCRYPT 2012. Lecture Notes in Computer Science, vol. 7237, pp. 9\u201326. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-29011-4_3"},{"key":"449_CR27","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s00145-011-9116-z","volume":"26","author":"A Joux","year":"2013","unstructured":"Joux A., Vitse V.: Elliptic curve discrete logarithm problem over small degree extension fields\u2014application to the static Diffie-Hellman problem on $$E({\\cal{F}}_{q}^{5})$$ E ( F q 5 ) . J. Cryptol. 26, 119\u2013143 (2013).","journal-title":"J. Cryptol."},{"key":"449_CR28","volume-title":"Hilbert Series and Dimension","author":"G Kemper","year":"2011","unstructured":"Kemper G.: Hilbert Series and Dimension. Springer, Berlin (2011)."},{"key":"449_CR29","unstructured":"Kleinjung T., Aoki K., Franke J., Lenstra A.K., Thom\u00e9 E., Bos J.W., Gaudry P., Kruppa A., Montgomery P.L., Osvik D.A., te Riele H.J.J., Timofeev A., Zimmermann P.: Factorization of a 768-Bit RSA Modulus. In: Proceedings of the Advances in Cryptology\u2014CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, 15\u201319 Aug, pp. 333\u2013350 (2010)."},{"key":"449_CR30","doi-asserted-by":"crossref","unstructured":"Kleinjung T., Diem C., Lenstra A.K., Priplata C., Stahlke C.: Computation of a $$768$$ 768 bits prime field discrete logarithm. In: Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2017\u201436th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, Apr 30\u2013May 4.","DOI":"10.1007\/978-3-319-56620-7_7"},{"key":"449_CR31","doi-asserted-by":"crossref","unstructured":"Lenstra A.K., Lenstra Jr H.W., Manasse M.S., Pollard J.M.: The number field sieve. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 13\u201317 May 1990, Baltimore, pp. 564\u2013572 (1990).","DOI":"10.1145\/100216.100295"},{"key":"449_CR32","unstructured":"Lidl R., Niederreiter H.: Finite Fields, Encyclopedia of Mathematics and its Applications 20 (Second ed., 1997). Cambridge University Press, Cambridge. ISBN 0-521-39231-4, Zbl 0866.11069."},{"key":"449_CR33","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.ffa.2016.01.009","volume":"39","author":"D Lubicz","year":"2016","unstructured":"Lubicz D., Robert D.: Arithmetic of Abelian and Kummer varieties. Finite Fields Appl. 39, 130\u2013158 (2016).","journal-title":"Finite Fields Appl."},{"key":"449_CR34","unstructured":"Mullen Gary L., Panario D.: Handbook of Finite Fields. CRC Press, Boca Raton. ISBN 978-1-4398-7378-6."},{"key":"449_CR35","doi-asserted-by":"crossref","unstructured":"Nagao K.-I.: Decomposition attack for the Jacobian of a hyperelliptic curve over an extension field. In: Proceedings of the Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, 19\u201323 July, pp. 285\u2013300 (2010).","DOI":"10.1007\/978-3-642-14518-6_23"},{"key":"449_CR36","unstructured":"Renes J., Schwabe P., Smith B., Batina L.: $$\\mu $$ \u03bc -Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers. In: Proceedings of the Cryptographic Hardware and Embedded Systems\u2014CHES 2016\u201418th International Conference, Santa Barbara, CA, USA, 17\u201319 Aug (2016)."},{"key":"449_CR37","unstructured":"Semaev I.: Summation polynomials and the discrete logarithm problem on elliptic curves. IACR Cryptology ePrint Archive (2004)."},{"key":"449_CR38","doi-asserted-by":"crossref","unstructured":"Shoup V.: Lower Bounds for Discrete Logarithms and Related Problems. In: Proceedings of the Advances in Cryptology\u2014EUROCRYPT \u201997, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, 11\u201315 May, pp. 256\u2013266 (1997).","DOI":"10.1007\/3-540-69053-0_18"},{"key":"449_CR39","volume-title":"NTL: A Library for Doing Number Theory","author":"V Shoup","year":"2005","unstructured":"Shoup V.: NTL: A Library for Doing Number Theory. New York University, Courant Institute, New York (2005)."},{"key":"449_CR40","unstructured":"The CADO-NFS Development Team. CADO-NFS, An Implementation of the Number Field Sieve Algorithm. http:\/\/cado-nfs.gforge.inria.fr\/ , Release 2.2.0 (2015)."},{"key":"449_CR41","unstructured":"Tran C.: Formules d\u2019addition sur les jacobiennes de courbes hyperelliptiques : application\u00e0 la cryptographie Ph.\u00a0D.\u00a0Thesis, (2014)."},{"key":"449_CR42","unstructured":"Vercauteren F.: Computing zeta functions of hyperelliptic curves over finite fields of characteristic $$2$$ 2 . Advances in Cryptology\u2013CRYPTO 2002. LNCS, vol. 2442, pp. 369\u2013384. Springer, Berlin (2002)."},{"key":"449_CR43","unstructured":"Verron T.: R\u00e9gularisation du calcul de bases de Gr\u00f6bner pour des syst\u00e8mes avec poids et d\u00e9terminantiels, et applications en imagerie m\u00e9dicale. Ph.\u00a0D.\u00a0Thesis (2016)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0449-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0449-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0449-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T04:23:43Z","timestamp":1570508623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0449-y"}},"subtitle":["Toward efficient computation of discrete logarithms in even characteristic"],"short-title":[],"issued":{"date-parts":[[2017,12,20]]},"references-count":43,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["449"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0449-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,20]]}}}