{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T14:59:53Z","timestamp":1771513193796,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,5]],"date-time":"2017-12-05T00:00:00Z","timestamp":1512432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,12,5]],"date-time":"2017-12-05T00:00:00Z","timestamp":1512432000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-1-0311"],"award-info":[{"award-number":["W911NF-17-1-0311"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s13389-017-0177-2","type":"journal-article","created":{"date-parts":[[2017,12,5]],"date-time":"2017-12-05T16:17:51Z","timestamp":1512490671000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Constructing multidimensional differential addition chains and their applications"],"prefix":"10.1007","volume":"9","author":[{"given":"Aaron","family":"Hutchinson","sequence":"first","affiliation":[]},{"given":"Koray","family":"Karabina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,5]]},"reference":[{"key":"177_CR1","doi-asserted-by":"crossref","unstructured":"Antipa, A., Brown, D., Gallant, R., Lambert, R., Struik, R., Vanstone, S.: Accelerated verification of ECDSA signatures. In: Selected Areas in Cryptography, SAC 2005, Lecture Notes in Computer Science, vol. 3897, pp. 307\u2013318 (2005)","DOI":"10.1007\/11693383_21"},{"key":"177_CR2","doi-asserted-by":"publisher","first-page":"2614","DOI":"10.1109\/TC.2013.112","volume":"63","author":"R Azarderakhsh","year":"2014","unstructured":"Azarderakhsh, R., Karabina, K.: A new double point multiplication algorithm and its application to binary elliptic curves with endomorphisms. IEEE Trans. Comput. 63, 2614\u20132619 (2014)","journal-title":"IEEE Trans. Comput."},{"key":"177_CR3","doi-asserted-by":"crossref","unstructured":"Azarderakhsh, R., Karabina, K.: Efficient algorithms and architectures for double point multiplication on elliptic curves. In: Proceedings of the Third Workshop on Cryptography and Security in Computing Systems\u2014CS2 2016. (2016)","DOI":"10.1145\/2858930.2858935"},{"key":"177_CR4","unstructured":"Bernstein, D.: Differential Addition Chains. Technical Report (2006). \n                    http:\/\/cr.yp.to\/ecdh\/diffchain-20060219.pdf"},{"key":"177_CR5","unstructured":"Bernstein, D., Lange, T.: Explicit-formulas database. \n                    http:\/\/hyperelliptic.org\/EFD\/"},{"key":"177_CR6","doi-asserted-by":"crossref","unstructured":"Bos, J., Costello, C., Hisil, H., Lauter, K.: High-performance scalar multiplication using 8-dimensional GLV\/GLS decomposition. In: Cryptographic Hardware and Embedded Systems\u2014CHES 2013, Lecture Notes in Computer Science, vol. 8086, pp. 331\u2013348 (2013)","DOI":"10.1007\/978-3-642-40349-1_19"},{"key":"177_CR7","unstructured":"Brown, D.: Multi-Dimensional Montgomery Ladders for Elliptic Curves. ePrint Archive: Report 2006\/220. \n                    http:\/\/eprint.iacr.org\/2006\/220"},{"key":"177_CR8","doi-asserted-by":"crossref","unstructured":"Costello, C., Longa, P.: FourQ: Four-dimensional decompositions on a $$Q$$-curve over the Mersenne prime. In: Advances in Cryptology ASIACRYPT 2015, Lecture Notes in Computer Science, vol. 9452, pp. 214\u2013235 (2015)","DOI":"10.1007\/978-3-662-48797-6_10"},{"key":"177_CR9","doi-asserted-by":"crossref","unstructured":"Faz-Hernandez, A., Longa, P., Sanchez, A.: Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV\u2013GLS curves. In: Topics in Cryptology CT-RSA 2014, Lecture Notes in Computer Science, vol. 8366, pp. 1\u201327 (2014)","DOI":"10.1007\/978-3-319-04852-9_1"},{"key":"177_CR10","doi-asserted-by":"crossref","unstructured":"Feng, M., Zhu, B., Zhao, C., Li, S.: Signed MSB-set comb method for elliptic curve point multiplication. In: Information Security Practice and Experience\u2014ISPEC 2006, Lecture Notes in Computer Science, vol. 3903, pp. 13\u201324 (2006)","DOI":"10.1007\/11689522_2"},{"key":"177_CR11","doi-asserted-by":"crossref","unstructured":"Galbraith, D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. J. Cryptol. 24, 446\u2013469 (2011)","DOI":"10.1007\/s00145-010-9065-y"},{"key":"177_CR12","doi-asserted-by":"crossref","unstructured":"Gallant, R., Lambert, R., Vanstone, S.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Advances in Cryptology\u2014CRYPTO 2011, LNCS, vol. 2139, pp. 190\u2013200 (2001)","DOI":"10.1007\/3-540-44647-8_11"},{"key":"177_CR13","doi-asserted-by":"crossref","unstructured":"Guillevic, A., Ionica, S.: Four-dimensional GLV via the Weil restriction. In: Advances in Cryptology, ASIACRYPT 2013, Lecture Notes in Computer Science, vol. 8269, pp. 79\u201396 (2013)","DOI":"10.1007\/978-3-642-42033-7_5"},{"key":"177_CR14","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\u2013Lin\u2013Scott point multiplication method for elliptic curves over binary fields. IEEE Trans. Comput. 58, 1411\u20131420 (2009)","journal-title":"IEEE Trans. Comput."},{"issue":"3439","key":"177_CR15","first-page":"85","volume":"2005","author":"M Hedabou","year":"2005","unstructured":"Hedabou, M., Pinel, P., Beneteau, L.: Countermeasures for preventing comb method against SCA attacks. Inf. Secur. Pract. Exp. ISPEC 2005(3439), 85\u201396 (2005)","journal-title":"Inf. Secur. Pract. Exp. ISPEC"},{"key":"177_CR16","doi-asserted-by":"crossref","unstructured":"Hisil, H., Wong, K., Carter, G., Dawson, E.: Twisted Edwards curves revisited. In: Advances in Cryptology\u2014ASIACRYPT 2008, Lecture Notes in Computer Science, vol. 5350, pp. 326\u2013343 (2008)","DOI":"10.1007\/978-3-540-89255-7_20"},{"key":"177_CR17","doi-asserted-by":"crossref","unstructured":"Joye, M., Tunstall, M.: Exponent recoding and regular exponentiation algorithms. Lecture Notes in Computer Science, AFRICACRYPT 2009(5580), 334\u2013349 (2009)","DOI":"10.1007\/978-3-642-02384-2_21"},{"key":"177_CR18","doi-asserted-by":"crossref","unstructured":"Lim, C., Lee, P.: More flexible exponentiation with precomputation. In: Advances in Cryptology CRYPTO 94, Lecture Notes in Computer Science, vol. 839, pp. 95\u2013107 (1994)","DOI":"10.1007\/3-540-48658-5_11"},{"key":"177_CR19","doi-asserted-by":"crossref","unstructured":"Longa, P., Sica, F.: Four-dimensional Gallant\u2013Lambert\u2013Vanstone scalar multiplication. In: Advances in Cryptology, ASIACRYPT 2012, Lecture Notes in Computer Science, vol. 7658, pp. 718\u2013739 (2012)","DOI":"10.1007\/978-3-642-34961-4_43"},{"key":"177_CR20","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. New York (1996)"},{"key":"177_CR21","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, B.: Algorithms for multi-exponentiation. In: Selected Areas in Computer Science SAC 2001, LNCS, 2259, pp. 165\u2013180 (2001)","DOI":"10.1007\/3-540-45537-X_13"},{"key":"177_CR22","unstructured":"Montgomery, P.: Evaluating recurrences of form $${X}_{m+n} = f({X}_m, {X}_n, {X}_{m-n})$$ via Lucas chains. \n                    https:\/\/cr.yp.to\/bib\/1992\/montgomery-lucas.ps\n                    \n                   (1983)"},{"key":"177_CR23","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P Montgomery","year":"1987","unstructured":"Montgomery, P.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48, 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"177_CR24","doi-asserted-by":"crossref","unstructured":"Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Advances in Cryptology CRYPTO 92, Lecture Notes in Computer Science, vol. 740, pp. 31\u201353 (1993)","DOI":"10.1007\/3-540-48071-4_3"},{"key":"177_CR25","doi-asserted-by":"crossref","unstructured":"Okeya, K., Takagi, T.: The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks. In: Topics in Cryptology\u2014CT-RSA 2003, Lecture Notes in Computer Science, vol. 2612, pp. 328\u2013343 (2003)","DOI":"10.1007\/3-540-36563-X_23"},{"key":"177_CR26","doi-asserted-by":"crossref","unstructured":"Rao, S.R.S.: Three dimensional montgomery ladder, differential point tripling on montgomery curves and point quintupling on Weierstrass and Edwards curves. In: Progress in Cryptology AFRICACRYPT 2016, Lecture Notes in Computer Science, vol. 9646, pp. 84\u2013106 (2016)","DOI":"10.1007\/978-3-319-31517-1_5"},{"key":"177_CR27","unstructured":"Shoup, V.: Ntl: A Library for doing number theory. \n                    http:\/\/www.shoup.net\/ntl\/"},{"key":"177_CR28","unstructured":"Stam, M.: Speeding up Subgroup Cryptosystems. PhD Thesis, Technische Universiteit Eindhoven (2003)"},{"key":"177_CR29","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1016\/j.ipl.2010.08.014","volume":"110","author":"Z Zhou","year":"2010","unstructured":"Zhou, Z., Hu, Z., Xu, M., Song, W.: Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves. Inf. Process. Lett. 110, 1003\u20131006 (2010)","journal-title":"Inf. Process. Lett."}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-017-0177-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-017-0177-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-017-0177-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T18:03:15Z","timestamp":1589652195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-017-0177-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,5]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["177"],"URL":"https:\/\/doi.org\/10.1007\/s13389-017-0177-2","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,5]]},"assertion":[{"value":"26 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}