{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:52:05Z","timestamp":1743151925218,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319716664"},{"type":"electronic","value":"9783319716671"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-71667-1_11","type":"book-chapter","created":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T05:08:45Z","timestamp":1511932125000},"page":"206-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Scalar Multiplication for Elliptic Curves over Binary Fields by Efficiently Computable Formulas"],"prefix":"10.1007","author":[{"given":"Saud","family":"Al Musa","sequence":"first","affiliation":[]},{"given":"Guangwu","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,30]]},"reference":[{"key":"11_CR1","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"RM Avanzi","year":"2005","unstructured":"Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Nguyen, K., Lange, T., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall\/CRC, Boca Raton (2005)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-77026-8_13","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: Optimizing double-base elliptic-curve single-scalar multiplication. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 167\u2013182. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-77026-8_13"},{"doi-asserted-by":"crossref","unstructured":"Berth\u00e9, V., Imbert, L.: On converting numbers to the double-base number system. In: Advanced Signal Processing Algorithms, Architecture and Implementations XIV, vol. 5559, pp. 70\u201378 (2004)","key":"11_CR3","DOI":"10.1117\/12.558895"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.ipl.2005.05.013","volume":"95","author":"IF Blake","year":"2005","unstructured":"Blake, I.F., Murty, V.K., Xu, G.: A note on window \n                    \n                      \n                    \n                    $$\\tau $$\n                    \n                      \n                        \u03c4\n                      \n                    \n                  -NAF algorithm. Inf. Process. Lett. 95(5), 496\u2013502 (2005)","journal-title":"Inf. Process. Lett."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.4153\/CJM-2008-054-1","volume":"60","author":"IF Blake","year":"2008","unstructured":"Blake, I.F., Murty, V.K., Xu, G.: Nonadjacent radix-\n                    \n                      \n                    \n                    $$\\tau $$\n                    \n                      \n                        \u03c4\n                      \n                    \n                   expansions of integers in euclidean imaginary quadratic number fields. Can. J. Math. 60, 1267\u20131282 (2008)","journal-title":"Can. J. Math."},{"key":"11_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"IF Blake","year":"1999","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10623-005-3299-y","volume":"39","author":"M Ciet","year":"2006","unstructured":"Ciet, M., Joye, M., Lauter, K., Montgomery, P.L.: Trading inversions for multiplications in elliptic curve cryptography. Desi. Codes Cryptogr. 39(2), 189\u2013206 (2006)","journal-title":"Desi. Codes Cryptogr."},{"issue":"262","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1090\/S0025-5718-07-02048-0","volume":"77","author":"V Dimitrov","year":"2008","unstructured":"Dimitrov, V., Imbert, L., Mishra, P.K.: The double-base number system and its application to elliptic curve cryptography. Math. Comput. 77(262), 1075\u20131104 (2008)","journal-title":"Math. Comput."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-662-45611-8_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"C Doche","year":"2014","unstructured":"Doche, C.: On the enumeration of double-base chains with applications to elliptic curve cryptography. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 297\u2013316. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-45611-8_16"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-70500-0_32","volume-title":"Information Security and Privacy","author":"C Doche","year":"2008","unstructured":"Doche, C., Habsieger, L.: A tree-based approach for computing double-base chains. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol. 5107, pp. 433\u2013446. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-70500-0_32"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11941378_24","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"C Doche","year":"2006","unstructured":"Doche, C., Imbert, L.: Extended double-base number system with applications to elliptic curve cryptography. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 335\u2013348. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11941378_24"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-01001-9_29","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"C Doche","year":"2009","unstructured":"Doche, C., Kohel, D.R., Sica, F.: Double-base number system for multi-scalar multiplications. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 502\u2013517. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-01001-9_29"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-01001-9_30","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"SD Galbraith","year":"2009","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 518\u2013535. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-01001-9_30"},{"key":"11_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 \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). \n                    https:\/\/doi.org\/10.1007\/3-540-44647-8_11"},{"issue":"10","key":"11_CR15","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":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44499-8_1","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2000","author":"D Hankerson","year":"2000","unstructured":"Hankerson, D., L\u00f3pez Hernandez, J., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2000. LNCS, vol. 1965, pp. 1\u201324. Springer, Heidelberg (2000). \n                    https:\/\/doi.org\/10.1007\/3-540-44499-8_1"},{"key":"11_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/b97644","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, New York (2004). \n                    https:\/\/doi.org\/10.1007\/b97644"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"N Koblitz","year":"1992","unstructured":"Koblitz, N.: CM-curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279\u2013287. Springer, Heidelberg (1992). \n                    https:\/\/doi.org\/10.1007\/3-540-46766-1_22"},{"issue":"177","key":"11_CR19","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. Computat. 48(177), 203\u2013209 (1987)","journal-title":"Math. Computat."},{"unstructured":"Lange, T.: A note on L\u00f3pez-Dahab coordinates. Cryptology ePrint Archive, Report 2004\/323 (2004). \n                    https:\/\/eprint.iacr.org","key":"11_CR20"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A Lenstra","year":"2001","unstructured":"Lenstra, A., Verheul, E.: Selecting cryptographic key sizes. J. Cryptol. 14, 255\u2013293 (2001)","journal-title":"J. Cryptol."},{"unstructured":"Longa, P.: Accelerating the scalar multiplication on elliptic curve cryptosystems over prime fields. Cryptology ePrint Archive, Report 2008\/100 (2008). \n                    https:\/\/eprint.iacr.org","key":"11_CR22"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-00468-1_25","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"P Longa","year":"2009","unstructured":"Longa, P., Gebotys, C.: Fast multibase methods and other several optimizations for elliptic curve scalar multiplication. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 443\u2013462. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-00468-1_25"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-48892-8_16","volume-title":"Selected Areas in Cryptography","author":"J L\u00f3pez","year":"1999","unstructured":"L\u00f3pez, J., Dahab, R.: Improved algorithms for elliptic curve arithmetic in GF(2n). In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 201\u2013212. Springer, Heidelberg (1999). \n                    https:\/\/doi.org\/10.1007\/3-540-48892-8_16"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"2204","DOI":"10.1109\/TC.2014.2360539","volume":"64","author":"N M\u00e9loni","year":"2015","unstructured":"M\u00e9loni, N., Hasan, M.: Efficient double bases for scalar multiplication. IEEE Trans. Comput. 64, 2204\u20132212 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 1985 Proceedings","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). \n                    https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-540-75496-1_26","volume-title":"Information Security","author":"PK Mishra","year":"2007","unstructured":"Mishra, P.K., Dimitrov, V.: Efficient quintuple formulas for elliptic curves and efficient scalar multiplication using multibase number representation. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol. 4779, pp. 390\u2013406. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-75496-1_26"},{"issue":"1","key":"11_CR28","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., Rodriguez-Henriquez, 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."},{"issue":"2\u20133","key":"11_CR29","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"JA Solinas","year":"2000","unstructured":"Solinas, J.A.: Efficient arithmetic on Koblitz curves. Des. Codes Cryptogr. 19(2\u20133), 195\u2013249 (2000)","journal-title":"Des. Codes Cryptogr."},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"2918","DOI":"10.1109\/TC.2015.2493517","volume":"65","author":"W Trost","year":"2016","unstructured":"Trost, W., Xu, G.: On the optimal pre-computation of window tNAF for Koblitz curves. IEEE Trans. Comput. 65, 2918\u20132924 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"11_CR31","first-page":"212","volume":"75","author":"S Yasin","year":"2015","unstructured":"Yasin, S., Muda, Z.: Tripling formulae of elliptic curve over binary field in Lopez-Dahab model. J. Theor. Appl. Inf. Technol. 75(2), 212\u2013217 (2015)","journal-title":"J. Theor. Appl. Inf. Technol."},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-22425-1_4","volume-title":"Advances in Information and Computer Security","author":"W Yu","year":"2015","unstructured":"Yu, W., Kim, K.H., Jo, M.S.: New fast algorithms for elliptic curve arithmetic in affine coordinates. In: Tanaka, K., Suga, Y. (eds.) IWSEC 2015. LNCS, vol. 9241, pp. 56\u201364. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-22425-1_4"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-38553-7_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2013","author":"W Yu","year":"2013","unstructured":"Yu, W., Wang, K., Li, B., Tian, S.: Triple-base number system for scalar multiplication. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 433\u2013451. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38553-7_26"},{"unstructured":"Digital Signature Standard (DSS): FIPS PUB. 186\u20134 (2013)","key":"11_CR34"},{"unstructured":"The GNU Multiple Precision Arithmetic Library. \n                    http:\/\/www.gmplib.org","key":"11_CR35"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71667-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:02:24Z","timestamp":1558321344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71667-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319716664","9783319716671"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71667-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"30 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chennai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/events.csa.iisc.ernet.in\/indocrypt2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}