{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:35:32Z","timestamp":1725827732402},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221731"},{"type":"electronic","value":"9783319221748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22174-8_17","type":"book-chapter","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T12:28:06Z","timestamp":1439555286000},"page":"308-326","source":"Crossref","is-referenced-by-count":2,"title":["Attacking a Binary GLS Elliptic Curve with Magma"],"prefix":"10.1007","author":[{"given":"Jes\u00fas-Javier","family":"Chi","sequence":"first","affiliation":[]},{"given":"Thomaz","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,15]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-55220-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"R Barbulescu","year":"2014","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 1\u201316. Springer, Heidelberg (2014)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-40349-1_19","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"JW Bos","year":"2013","unstructured":"Bos, J.W., Costello, C., Hisil, H., Lauter, K.: High-performance scalar multiplication using 8-dimensional GLV\/GLS decomposition. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 331\u2013348. Springer, Heidelberg (2013)"},{"key":"17_CR3","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography, (2nd edn). Chapman & Hall\/CRC (2012)"},{"key":"17_CR4","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. Compositio Mathematica 147, 75\u2013104 (2011)","journal-title":"Compositio Mathematica"},{"key":"17_CR5","unstructured":"Dierks, T., Rescorla, E.: The Transport Layer Security (TLS) Protocol Version 1.2. RFC 5246 (Proposed Standard) (2008). \n                      http:\/\/www.ietf.org\/rfc\/rfc5246.txt"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4064\/aa102-1-6","volume":"102","author":"A Enge","year":"2002","unstructured":"Enge, A., Gaudry, P.: A general framework for subexponential discrete logarithm algorithms. Acta Arithmetica 102(1), 83\u2013103 (2002)","journal-title":"Acta Arithmetica"},{"key":"17_CR7","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":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-04852-9_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"A Faz-Hern\u00e1ndez","year":"2014","unstructured":"Faz-Hern\u00e1ndez, A., Longa, P., S\u00e1nchez, A.H.: Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV-GLS curves. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 1\u201327. Springer, Heidelberg (2014)"},{"key":"17_CR9","unstructured":"Frey, G.: How to disguise an elliptic curve. In: Talk at ECC 1998 (Workshop on Elliptic Curve Cryptography), Waterloo (1998). \n                      http:\/\/www.cacr.math.uwaterloo.ca\/conferences\/1998\/ecc98\/frey.ps"},{"key":"17_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139012843","volume-title":"Mathematics of Public Key Cryptography","author":"SD Galbraith","year":"2012","unstructured":"Galbraith, S.D.: Mathematics of Public Key Cryptography, 1st edn. Cambridge University Press, New York, NY, USA (2012)","edition":"1"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-46035-7_3","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"SD Galbraith","year":"2002","unstructured":"Galbraith, S.D., Hess, F., Smart, N.P.: Extending the GHS Weil Descent Attack. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 29\u201344. Springer, Heidelberg (2002)"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00145-010-9065-y","volume":"24","author":"SD Galbraith","year":"2011","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. J. Cryptology 24(3), 446\u2013469 (2011)","journal-title":"J. Cryptology"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-46665-7_23","volume-title":"Cryptography and Coding","author":"SD Galbraith","year":"1999","unstructured":"Galbraith, S.D., Smart, N.P.: A cryptographic application of weil descent. In: Walker, M. (ed.) Cryptography and Coding 1999. LNCS, vol. 1746, pp. 191\u2013200. Springer, Heidelberg (1999)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"P Gaudry","year":"2000","unstructured":"Gaudry, P.: An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 19\u201334. Springer, Heidelberg (2000)"},{"issue":"12","key":"17_CR16","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(12), 1690\u20131702 (2009)","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"17_CR17","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. Cryptology 15(1), 19\u201346 (2002)","journal-title":"J. Cryptology"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1090\/S0025-5718-06-01900-4","volume":"76","author":"P Gaudry","year":"2007","unstructured":"Gaudry, P., Thom\u00e9, E., Th\u00e9riault, N., Diem, C.: A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. 76, 475\u2013492 (2007)","journal-title":"Math. Comput."},{"issue":"10","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1109\/TC.2009.61","volume":"58","author":"D Hankerson","year":"2009","unstructured":"Hankerson, D., Karabina, K., Menezes, A.: Analyzing the Galbraith-Lin-Scott point multiplication method for elliptic curves over binary fields. IEEE Trans. Comput. 58(10), 1411\u20131420 (2009)","journal-title":"IEEE Trans. Comput."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1112\/S146115700000108X","volume":"7","author":"F Hess","year":"2004","unstructured":"Hess, F.: Generalising the GHS attack on the elliptic curve discrete logarithm problem. LMS J. Comput. Math. 7, 167\u2013192 (2004)","journal-title":"LMS J. Comput. Math."},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10623-011-9558-1","volume":"63","author":"Z Hu","year":"2012","unstructured":"Hu, Z., Longa, P., Xu, M.: Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0. Des. Codes Crypt. 63(3), 331\u2013343 (2012)","journal-title":"Des. Codes Crypt."},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-29011-4_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Joux","year":"2012","unstructured":"Joux, A., Vitse, V.: Cover and decomposition index calculus on elliptic curves made practical. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 9\u201326. Springer, Heidelberg (2012)"},{"issue":"177","key":"17_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/s00145-012-9144-3","volume":"27","author":"P Longa","year":"2014","unstructured":"Longa, P., Sica, F.: Four-dimensional Gallant-Lambert-Vanstone scalar multiplication. J. Cryptology 27(2), 248\u2013283 (2014)","journal-title":"J. Cryptology"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-45353-9_23","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"A Menezes","year":"2001","unstructured":"Menezes, A., Qu, M.: Analysis of the Weil descent attack of Gaudry, Hess and Smart. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 308\u2013318. Springer, Heidelberg (2001)"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-24660-2_28","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"A Menezes","year":"2004","unstructured":"Menezes, A., Teske, E., Weng, A.: Weak Fields for ECC. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 366\u2013386. Springer, Heidelberg (2004)"},{"issue":"5","key":"17_CR27","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"AJ Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theor. 39(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-14518-6_23","volume-title":"Algorithmic Number Theory","author":"K Nagao","year":"2010","unstructured":"Nagao, K.: Decomposition attack for the Jacobian of a hyperelliptic curve over an extension field. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS-IX. LNCS, vol. 6197, pp. 285\u2013300. Springer, Heidelberg (2010)"},{"key":"17_CR30","unstructured":"National Institute of Standards and Technology: FIPS PUB 186\u20134. Digital Signature Standard (DSS), Department of Commerce, U.S (2013)"},{"issue":"1","key":"17_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13389-013-0069-z","volume":"4","author":"T Oliveira","year":"2014","unstructured":"Oliveira, T., L\u00f3pez, J., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F.: Two is the fastest prime: lambda coordinates for binary elliptic curves. J. Cryptographic Eng. 4(1), 3\u201317 (2014)","journal-title":"J. Cryptographic Eng."},{"key":"17_CR32","first-page":"918","volume":"32","author":"J Pollard","year":"1978","unstructured":"Pollard, J.: Monte Carlo methods for index computation (mod p). Math. Comput. 32, 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"17_CR33","unstructured":"Sarkar, P., Singh, S.: A New Method for Decomposition in the Jacobian of Small Genus Hyperelliptic Curves. Cryptology ePrint Archive, Report 2014\/815 (2014). \n                      http:\/\/eprint.iacr.org\/"},{"key":"17_CR34","unstructured":"Sarkar, P., Singh, S.: A simple method for obtaining relations among factor basis elements for special hyperelliptic curves. Cryptology ePrint Archive, Report 2015\/179 (2015). \n                      http:\/\/eprint.iacr.org\/"},{"key":"17_CR35","unstructured":"Semaev, I.: Summation polynomials and the discrete logarithm problem on elliptic curves. Cryptology ePrint Archive, Report 2004\/031 (2004). \n                      http:\/\/eprint.iacr.org\/"},{"key":"17_CR36","unstructured":"Stebila, D.: Elliptic Curve Algorithm Integration in the Secure Shell Transport Layer. RFC 5656 (Proposed Standard) (2009). \n                      http:\/\/www.ietf.org\/rfc\/rfc5656.txt"},{"issue":"2","key":"17_CR37","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01404549","volume":"2","author":"J Tate","year":"1966","unstructured":"Tate, J.: Endomorphisms of abelian varieties over finite fields. Inventiones math. 2(2), 134\u2013144 (1966)","journal-title":"Inventiones math."},{"key":"17_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BFb0054891","volume-title":"Algorithmic Number Theory","author":"E Teske","year":"1998","unstructured":"Teske, E.: Speeding up Pollard\u2019s Rho method for computing discrete logarithms. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 541\u2013554. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology -- LATINCRYPT 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22174-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T12:55:27Z","timestamp":1559220927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-22174-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221731","9783319221748"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22174-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}