{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T11:16:55Z","timestamp":1772795815202,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662493861","type":"print"},{"value":"9783662493878","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49387-8_1","type":"book-chapter","created":{"date-parts":[[2016,2,17]],"date-time":"2016-02-17T14:25:41Z","timestamp":1455719141000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Petit","sequence":"first","affiliation":[]},{"given":"Michiel","family":"Kosters","sequence":"additional","affiliation":[]},{"given":"Ange","family":"Messeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,18]]},"reference":[{"key":"1_CR1","unstructured":"Bardet, M.: Etude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. Ph.D. thesis, Universit\u00e9 Paris 6 (2004)"},{"key":"1_CR2","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1984","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. Aegean Park Press, Laguna Hills (1984)"},{"key":"1_CR3","unstructured":"Br\u00f6ker, R.: Constructing elliptic curves of prescribed order. PhD thesis, University of Leiden (2006)"},{"key":"1_CR4","first-page":"33","volume":"46","author":"G Cornacchia","year":"1903","unstructured":"Cornacchia, G.: Su di un metodo per la risoluzione in numeri interi dell\u2019 equazione \n                      \n                        \n                      \n                      $$\\sum _{h=0}^nc_hx^{n-h}y^h=p$$\n                    . Giorn. Mat. Battaglini 46, 33\u201390 (1903)","journal-title":"Giorn. Mat. Battaglini"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/0-387-34799-2_38","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"B Boer den","year":"1990","unstructured":"den Boer, B.: Diffie-Hellman is as strong as discrete log for certain primes. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 530\u2013539. Springer, Heidelberg (1990)"},{"key":"1_CR6","doi-asserted-by":"publisher","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. Compos. Math. 147, 75\u2013104 (2011)","journal-title":"Compos. Math."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.2140\/ant.2013.7.1281","volume":"7","author":"C Diem","year":"2013","unstructured":"Diem, C.: On the discrete logarithm problem in elliptic curves II. Algebra Number Theory 7, 1281\u20131323 (2013)","journal-title":"Algebra Number Theory"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-29011-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"J-C Faug\u00e8re","year":"2012","unstructured":"Faug\u00e8re, J.-C., Perret, L., Petit, C., Renault, G.: Improving the complexity of index calculus algorithms in elliptic curves over binary fields. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 27\u201344. Springer, Heidelberg (2012)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/978-3-319-13039-2_24","volume-title":"Progress in Cryptology - INDOCRYPT","author":"SD Galbraith","year":"2014","unstructured":"Galbraith, S.D., Gebregiyorgis, S.W.: Summation polynomial algorithms for elliptic curves in characteristic two. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 409\u2013427. Springer, Heidelberg (2014)"},{"issue":"12","key":"1_CR10","doi-asserted-by":"publisher","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":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-662-47989-6_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"MA Huang","year":"2015","unstructured":"Huang, M.A., Kosters, M., Yeo, S.L.: Last fall degree, HFE, and Weil descent attacks on ECDLP. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 581\u2013600. Springer, Heidelberg (2015)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-41383-4_8","volume-title":"Advances in Information and Computer Security","author":"Y-J Huang","year":"2013","unstructured":"Huang, Y.-J., Petit, C., Shinohara, N., Takagi, T.: Improvement of faug\u00e8re et al.\u2019s method to solve ecdlp. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 115\u2013132. Springer, Heidelberg (2013)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves. Ann. of Math. 126, 649\u2013673 (1987)","journal-title":"Ann. of Math."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Advances in Cryptology - CRYPTO 1994","author":"UM Maurer","year":"1994","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the diffie-hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 271\u2013281. Springer, Heidelberg (1994)"},{"key":"1_CR15","unstructured":"Petit, C.: Bounding HFE with SRA (2014). \n                      http:\/\/perso.uclouvain.be\/christophe.petit\/files\/SRA_GB.pdf"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1112\/S1461157014000138","volume":"17A","author":"C Petit","year":"2014","unstructured":"Petit, C.: Finding roots in \n                      \n                        \n                      \n                      $$GF(p^n)$$\n                     with the successive resultant algorithm. LMS J. Comput. Math. 17A, 203\u2013217 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-34961-4_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"C Petit","year":"2012","unstructured":"Petit, C., Quisquater, J.-J.: On polynomial systems arising from a weil descent. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 451\u2013466. Springer, Heidelberg (2012)"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"SC Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over \n                      \n                        \n                      \n                      $$GF(p)$$\n                     and its cryptographic significance (corresp.). IEEE Trans. Inf. Theory 24(1), 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR19","unstructured":"Semaev, I.: Summation polynomials and the discrete logarithm problem on elliptic curves. Cryptology ePrint Archive, Report \/031 (2004). \n                      http:\/\/eprint.iacr.org\/"},{"key":"1_CR20","unstructured":"Semaev, I.: New algorithm for the discrete logarithm problem on elliptic curves. Cryptology ePrint Archive, Report \/310 (2015). \n                      http:\/\/eprint.iacr.org\/"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/978-3-642-42001-6_7","volume-title":"Number Theory and Cryptography","author":"M Shantz","year":"2013","unstructured":"Shantz, M., Teske, E.: Solving the elliptic curve discrete logarithm problem using semaev polynomials, weil descent and gr\u00f6bner basis methods \u2013 an experimental study. In: Fischlin, M., Katzenbeisser, S. (eds.) Buchmann Festschrift. LNCS, vol. 8260, pp. 94\u2013107. Springer, Heidelberg (2013)"},{"issue":"273","key":"1_CR22","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1090\/S0025-5718-2010-02373-7","volume":"80","author":"AV Sutherland","year":"2011","unstructured":"Sutherland, A.V.: Computing Hilbert class polynomials with the Chinese remainder theorem. Math. Comput. 80(273), 501\u2013538 (2011)","journal-title":"Math. Comput."},{"key":"1_CR23","first-page":"238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Communications de l\u2019Acad\u00e9mie royale des Sciences de Paris 273, 238\u2013241 (1971)","journal-title":"Communications de l\u2019Acad\u00e9mie royale des Sciences de Paris"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49387-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T11:20:12Z","timestamp":1582024812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49387-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493861","9783662493878"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49387-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"18 February 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}