{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:00:41Z","timestamp":1725850841488},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319308395"},{"type":"electronic","value":"9783319308401"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30840-1_10","type":"book-chapter","created":{"date-parts":[[2016,3,9]],"date-time":"2016-03-09T09:15:22Z","timestamp":1457514922000},"page":"155-168","source":"Crossref","is-referenced-by-count":2,"title":["Point Decomposition Problem in Binary Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Koray","family":"Karabina","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,10]]},"reference":[{"key":"10_CR1","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, 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"10_CR2","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":"10_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J-C Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Groebner bases (F4). J. Pure Appl. Algebra 139, 61\u201368 (1999)","journal-title":"J. Pure Appl. Algebra"},{"doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Groebner bases without reduction to zero (F5). In: International Symposium on Symbolic and Algebraic Computation, pp. 75\u201383 (2002)","key":"10_CR4","DOI":"10.1145\/780506.780516"},{"key":"10_CR5","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":"10_CR6","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 \u2013 INDOCRYPT 2014","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.) Progress in Cryptology \u2013 INDOCRYPT 2014. LNCS, vol. 8885, pp. 409\u2013427. Springer, Berlin (2014)"},{"key":"10_CR7","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. Symbolic Comput. 44, 1690\u20131702 (2009)","journal-title":"J. Symbolic Comput."},{"key":"10_CR8","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: Terada, M., Sakiyama, K. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 115\u2013132. Springer, Heidelberg (2013)"},{"unstructured":"Kosters, M., Yeo, S.: Notes on summation polynomials (2015). \n                      arXiv:1503.08001","key":"10_CR9"},{"key":"10_CR10","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)"},{"unstructured":"Semaev, I.: Summation polynomials and the discrete logarithm problem on elliptic curves, Cryptology ePrint Archive: Report\/031 (2004)","key":"10_CR11"},{"unstructured":"Semaev, I.: New algorithm for the discrete logarithm problem on elliptic curves, Cryptology ePrint Archive: Report 2015\/310 (2015)","key":"10_CR12"},{"key":"10_CR13","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)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30840-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:53:20Z","timestamp":1559397200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30840-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319308395","9783319308401"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30840-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}