{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:30:07Z","timestamp":1725888607136},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319598697"},{"type":"electronic","value":"9783319598703"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59870-3_20","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T02:14:17Z","timestamp":1496110457000},"page":"349-365","source":"Crossref","is-referenced-by-count":0,"title":["Secure GLS Recomposition for Sum-of-Square Cofactors"],"prefix":"10.1007","author":[{"given":"Eunkyung","family":"Kim","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-662-45611-8_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"DF Aranha","year":"2014","unstructured":"Aranha, D.F., Fouque, P.-A., G\u00e9rard, B., Kammerer, J.-G., Tibouchi, M., Zapalowicz, J.-C.: GLV\/GLS decomposition, power analysis, and attacks on ECDSA signatures with single-bit nonce bias. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 262\u2013281. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45611-8_14"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Berndt, B.C.: Number Theory in the Sprit of Ramanujan. American Mathematical Society (2006)","DOI":"10.1090\/stml\/034"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-68164-9_26"},{"key":"20_CR4","unstructured":"Bernstein, D.J., Lange, T.: eBACS: ECRYPT benchmarking of cryptographic systems. https:\/\/bench.cr.yp.to . Accessed 24 Mar 2017"},{"key":"20_CR5","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). doi: 10.1007\/978-3-642-40349-1_19"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-02384-2_24","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"BB Brumley","year":"2009","unstructured":"Brumley, B.B., Nyberg, K.: On modular decomposition of integers. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 386\u2013402. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02384-2_24"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-55220-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"C Costello","year":"2014","unstructured":"Costello, C., Hisil, H., Smith, B.: Faster compact Diffie\u2013Hellman: endomorphisms on the x-line. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 183\u2013200. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-55220-5_11"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-662-48797-6_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"C Costello","year":"2015","unstructured":"Costello, C., Longa, P.: Four $$\\mathbb{Q}$$ : four-dimensional decompositions on a $$\\mathbb{Q}$$ -curve over the Mersenne prime. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 214\u2013235. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48797-6_10"},{"issue":"3","key":"20_CR9","doi-asserted-by":"crossref","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. Cryptol. 24(3), 446\u2013469 (2011)","journal-title":"J. Cryptol."},{"key":"20_CR10","unstructured":"Gallant, R.: Efficient multiplication on curves having an endomorphism of norm 1. Workshop on Elliptic Curve Cryptography (1999)"},{"key":"20_CR11","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 \u2014 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). doi: 10.1007\/3-540-44647-8_11"},{"key":"20_CR12","unstructured":"Hankerson, D., Karabina, K., Menezes, A.: Analyzing the Galbraith-Lin-Scott point multiplication method for elliptic curves over binary fields. Cryptology ePrint Archive, Report 2008\/334 (2008). http:\/\/eprint.iacr.org\/2008\/334"},{"issue":"1","key":"20_CR13","doi-asserted-by":"crossref","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. Cryptogr. Eng. 4(1), 3\u201317 (2014)","journal-title":"J. Cryptogr. Eng."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45664-3_23","volume-title":"Public Key Cryptography","author":"Y-H Park","year":"2002","unstructured":"Park, Y.-H., Jeong, S., Kim, C.H., Lim, J.: An alternate decomposition of an integer for faster point multiplication on certain elliptic curves. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 323\u2013334. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45664-3_23"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59870-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T06:50:40Z","timestamp":1569394240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59870-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319598697","9783319598703"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59870-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}