{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:37Z","timestamp":1772283577106,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319315164","type":"print"},{"value":"9783319315171","type":"electronic"}],"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-31517-1_5","type":"book-chapter","created":{"date-parts":[[2016,4,6]],"date-time":"2016-04-06T16:48:05Z","timestamp":1459961285000},"page":"84-106","source":"Crossref","is-referenced-by-count":9,"title":["Three Dimensional Montgomery Ladder, Differential Point Tripling on Montgomery Curves and Point Quintupling on Weierstrass\u2019 and Edwards Curves"],"prefix":"10.1007","author":[{"given":"Srinivasa Rao","family":"Subramanya Rao","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","DOI":"10.1201\/9781420057133","volume-title":"Cryptography: Theory and Practice","author":"D Stinson","year":"2005","unstructured":"Stinson, D.: Cryptography: Theory and Practice, 3rd edn. CRC Press, Boca Raton (2005)","edition":"3"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"806","DOI":"10.2307\/2310929","volume":"71","author":"R Bellman","year":"1964","unstructured":"Bellman, R., Straus, E.G.: Addition chains of vectors (problem 5125). Am. Math. Mon. 71, 806\u2013808 (1964)","journal-title":"Am. Math. Mon."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme base on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"5_CR4","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H Cohen","year":"2006","unstructured":"Cohen, H., Frey, G.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2006)"},{"key":"5_CR5","unstructured":"Solinas, J.A.: Low-weight binary representations for pairs of integers. Combinatorics and Optimization Research Report CORR 2001-41. University of Waterloo (2001)"},{"issue":"177","key":"5_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-45537-X_20","volume-title":"Selected Areas in Cryptography (SAC)","author":"T Akishita","year":"2001","unstructured":"Akishita, T.: Fast simultaneous scalar multiplication on elliptic curve with montgomery form. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 255\u2013267. Springer, Heidelberg (2001)"},{"key":"5_CR8","unstructured":"Stam, M.: Speeding up subgroup cryptosystems. Ph.D. thesis, Technische Universiteit Eindhoven (2003)"},{"key":"5_CR9","unstructured":"Knuth, D.E.: The Art of Computer Programming. Seminumerical algorithms, vol. 2, 3rd edn. Pearson, London (1998)"},{"key":"5_CR10","unstructured":"Bernstein, D.J.: Differential Addition Chains (2006). http:\/\/cr.yp.to\/ecdh\/diffchain-20060219.pdf . Accessed 25 January 2015"},{"key":"5_CR11","unstructured":"Brown, D.R.L.: Multi-dimensional Montgomery ladders for elliptic curves (2006). http:\/\/eprint.iacr.org\/2006\/220 . Accessed 25 January 2015"},{"key":"5_CR12","unstructured":"Brown, D.R.L.: Multi-dimensional Montgomery ladders for elliptic curves. Patent No. US8750500 B2 (2014). http:\/\/www.google.com\/patents\/US8750500"},{"key":"5_CR13","unstructured":"Montgomery, P.L.: Evaluating recurrences of form $$X_{m+n} = f(x_{m}, X_{n}, X_{m-n})$$ via Lucas chains (1992). https:\/\/cr.yp.to\/bib\/1992\/montgomery-lucas.ps . Accessed 2 February 2016"},{"key":"5_CR14","unstructured":"Azarderakhsh, R., Karabina, K.: A New Double Point Multiplication Method and its Implementation on Binary Elliptic Curves with Endomorphisms. http:\/\/cacr.uwaterloo.ca\/techreports\/2012\/cacr2012-24.pdf"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44709-1_12","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"K Okeya","year":"2001","unstructured":"Okeya, K., Sakurai, K.: Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a montgomery form elliptic curve. In: Ko, K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 126\u2013141. Springer, Heidelberg (2001)"},{"key":"5_CR16","series-title":"Cambridge Monographs on Applied and Computational Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921698","volume-title":"Modern Computer Arithmetic","author":"R Brent","year":"2010","unstructured":"Brent, R., Zimmermann, P.: Modern Computer Arithmetic. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, Cambridge (2010)"},{"key":"5_CR17","first-page":"384","volume-title":"Proceedings of International Conference on Security and Cryptography, SECRYPT 2015","author":"SR Subramanya Rao","year":"2015","unstructured":"Subramanya Rao, S.R.: A note on Schoenmakers\u2019 algorithm for multi-exponentiation. In: Obaidat, M.S., Lorenz, P., Samarati, P. (eds.) Proceedings of International Conference on Security and Cryptography, SECRYPT 2015, pp. 384\u2013391. SciTePress, Set\u00fabal (2015)"},{"key":"5_CR18","volume-title":"Handbook of Applied Cryptography","author":"A Menezes","year":"1997","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. Taylor and Francis, London (1997)"},{"key":"5_CR19","unstructured":"Antipa, A., Brown, D., Gallant, R., Lambert, R., Struik, R., Vanstone, S.: Accelerated verification of ECDSA signatures. http:\/\/cacr.uwaterloo.ca\/techreports\/2005\/cacr2005-28.pdf . Accessed 2 February 2016"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/978-3-540-71677-8_29","volume-title":"Public Key Cryptography (PKC)","author":"JH Cheon","year":"2007","unstructured":"Cheon, J.H., Yi, J.H.: Fast batch verification of multiple signatures. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 442\u2013457. Springer, Heidelberg (2007)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-319-12060-7_16","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"S Karati","year":"2014","unstructured":"Karati, S., Das, A., Roychoudhury, D.: Randomized batch verification of standard ECDSA signatures. In: Chakraborty, R.S., Matyas, V., Schaumont, P. (eds.) SPACE 2014. LNCS, vol. 8804, pp. 237\u2013255. Springer, Heidelberg (2014)"},{"key":"5_CR22","unstructured":"Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication. https:\/\/cr.yp.to\/antiforgery\/doublebase-20071028.pdf . Accessed 2 February 2016"},{"key":"5_CR23","unstructured":"Dimitrov, V.S., Imbert, L., Mishra, P.K.: Efficient and Secure Elliptic Curve Point Multiplicaton Using Double-Base Chains. https:\/\/www.iacr.org\/archive\/asiacrypt2005\/059\/059.pdf . Accessed 2 February 2016"},{"issue":"7","key":"5_CR24","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/81.401149","volume":"42","author":"VS Dimitrov","year":"1995","unstructured":"Dimitrov, V.S., Cooklev, T.: Hybrid algorithm for the computation of the matrix polynomial $$I+A+ \\dots +A^{n-1}$$ . IEEE Trans. Circ. Syst. 42(7), 377\u2013380 (1995)","journal-title":"IEEE Trans. Circ. Syst."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Mishra, P.K., Dimitrov, V.S.: Efficient Quintuple Formuals for Elliptic Curves and Efficeint Scalar Multiplication Using Multibase Number Representation. https:\/\/eprint.iacr.org\/2007\/040.pdf . Accessed 2 February 2016","DOI":"10.1007\/978-3-540-75496-1_26"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Giorgi, P., Imbert, L., Izard, T.: Optimizing elliptic curve scalar multiplications for small scalars. In: Mathematics for Signal and Information Processing, San Diego, CA, United States, p. 74440N (2009)","DOI":"10.1117\/12.827689"},{"key":"5_CR27","unstructured":"Longa, P., Miri, A.: New Multibase Non-Adjacent Form Scalar Multiplication and its applications to Elliptic Curve Cryptosystems. https:\/\/eprint.iacr.org\/2008\/052.pdf . Accessed 2 February 2016"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-48059-5_27","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J Lopez","year":"1999","unstructured":"Lopez, J., Dahab, R.: Fast multiplication on elliptic curves over $$GF(2^m)$$ without precomputation. In: Ko, K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 316\u2013327. Springer, Heidelberg (1999)"},{"key":"5_CR29","unstructured":"Fischer, W., Giraud, C., Knudsen, E.W., Seifert, J.-P.: Parallel scalar multiplication on general elliptic curves over $$\\mathbb{F}_p$$ hedged against Non-Differential Side-Channel Attacks. http:\/\/eprint.iacr.org\/2002\/007.pdf . Accessed 2 February 2016"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"PKC 2002","author":"E Brier","year":"2002","unstructured":"Brier, E., Joye, M.: Weierstrass elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 335\u2013345. Springer, Heidelberg (2002)"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-85053-3_16","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Rezaeian Farashahi, R.: Binary edwards curves. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 244\u2013265. Springer, Heidelberg (2008)"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-16825-3_21","volume-title":"Advances in Information and Computer Security","author":"B Justus","year":"2010","unstructured":"Justus, B., Loebenberger, D.: Differential addition in generalized edwards coordinates. In: Echizen, I., Kunihiro, N., Sasaki, R. (eds.) IWSEC 2010. LNCS, vol. 6434, pp. 316\u2013325. Springer, Heidelberg (2010)"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-19074-2_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"J Devigne","year":"2011","unstructured":"Devigne, J., Joye, M.: Binary huff curves. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 340\u2013355. Springer, Heidelberg (2011)"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-21969-6_11","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"M Hutter","year":"2011","unstructured":"Hutter, M., Joye, M., Sierra, Y.: Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate representation. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 170\u2013187. Springer, Heidelberg (2011)"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-34931-7_23","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"H Wu","year":"2012","unstructured":"Wu, H., Tang, C., Feng, R.: A new model of binary elliptic curves. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 399\u2013411. Springer, Heidelberg (2012)"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-13013-7_15","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"RR Farashahi","year":"2010","unstructured":"Farashahi, R.R., Joye, M.: Efficient arithmetic on hessian curves. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 243\u2013260. Springer, Heidelberg (2010)"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-33481-8_3","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2012","author":"R Abarz\u00faa","year":"2012","unstructured":"Abarz\u00faa, R., Th\u00e9riault, N.: Complete atomic blocks for elliptic curves in jacobian coordinates over prime fields. In: Hevia, A., Neven, G. (eds.) LatinCrypt 2012. LNCS, vol. 7533, pp. 37\u201355. Springer, Heidelberg (2012)"},{"issue":"3","key":"5_CR38","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TC.2007.70815","volume":"57","author":"P Longa","year":"2008","unstructured":"Longa, P., Miri, A.: Fast and flexible elliptic curves point arithmetic over prime fields. IEEE Trans. Comput. 57(3), 289\u2013302 (2008)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR39","unstructured":"Bernstein, D.J.: Curve25519: New Diffie Hellman Speed Records. https:\/\/cr.yp.to\/ecdh\/curve25519-20060209.pdf . Accessed 2 February 2016"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31517-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T05:26:08Z","timestamp":1655443568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31517-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319315164","9783319315171"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31517-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}