{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:28Z","timestamp":1772283568127,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642150302","type":"print"},{"value":"9783642150319","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15031-9_5","type":"book-chapter","created":{"date-parts":[[2010,8,7]],"date-time":"2010-08-07T15:34:35Z","timestamp":1281195275000},"page":"65-79","source":"Crossref","is-referenced-by-count":28,"title":["Co-Z Addition Formul\u00e6 and Binary Ladders on Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Raveen R.","family":"Goundar","sequence":"first","affiliation":[]},{"given":"Marc","family":"Joye","sequence":"additional","affiliation":[]},{"given":"Atsuko","family":"Miyaji","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"R. Avanzi","year":"2005","unstructured":"Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)"},{"key":"5_CR2","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database, \n                    \n                      http:\/\/www.hyperelliptic.org\/EFD\/jacobian.html"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-44598-6_8","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I. Biehl","year":"2000","unstructured":"Biehl, I., Meyer, B., M\u00fcller, V.: Differential fault attacks on elliptic curve cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 131\u2013146. Springer, Heidelberg (2000)"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/s001450010016","volume":"14","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of eliminating errors in cryptographic computations. Journal of Cryptology\u00a014(2), 110\u2013119 (2001); Extended abstract in Proc. of EUROCRYPT\u201997 (1997)","journal-title":"Journal of Cryptology"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"Public Key Cryptography","author":"E. Brier","year":"2002","unstructured":"Brier, E., Joye, M.: Weierstra\u00df elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 335\u2013345. Springer, Heidelberg (2002)"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D.V. Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Advances in Applied Mathematics\u00a07(4), 385\u2013434 (1986)","journal-title":"Advances in Applied Mathematics"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-48059-5_25","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J.-S. Coron","year":"1999","unstructured":"Coron, J.-S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 292\u2013302. Springer, Heidelberg (1999)"},{"key":"5_CR9","unstructured":"Fischer, W., Giraud, C., Knudsen, E.W., Seifert, J.-P.: Parallel scalar multiplication on general elliptic curves over \n                    \n                      \n                    \n                    $\\mathbb{F}_p$\n                   hedged against non-differential side-channel attacks. Cryptology ePrint Archive, Report 2002\/007 (2002), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/FDTC.2008.15","volume-title":"Fault Diagnosis and Tolerance in Cryptography (FDTC\u00a02008)","author":"P.-A. Fouque","year":"2008","unstructured":"Fouque, P.-A., Lercier, R., R\u00e9al, D., Valette, F.: Fault attack on elliptic curve Montgomery ladder implementation. In: Breveglieri, L., et al. (eds.) Fault Diagnosis and Tolerance in Cryptography (FDTC\u00a02008), pp. 92\u201398. IEEE Computer Society, Los Alamitos (2008)"},{"key":"5_CR11","unstructured":"Galbraith, S., Lin, X., Scott, M.: A faster way to do ECC. Presented at 12th Workshop on Elliptic Curve Cryptography (ECC\u00a02008), Utrecht, The Netherlands, September 22\u201324 (2008), Slides available at, \n                    \n                      http:\/\/www.hyperelliptic.org\/tanja\/conf\/ECC08\/slides\/Mike-Scott.pdf"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Goundar, R.R., Joye, M., Miyaji, A.: Co-Z addition formul\u00e6 and binary ladders on elliptic curves. Cryptology ePrint Archive, Report 2010\/309 (2010), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-15031-9_5"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45664-3_20","volume-title":"Public Key Cryptography","author":"T. Izu","year":"2002","unstructured":"Izu, T., Takagi, T.: A fast parallel elliptic curve multiplication resistant against side channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 280\u2013296. Springer, Heidelberg (2002)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-74735-2_10","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"M. Joye","year":"2007","unstructured":"Joye, M.: Highly regular right-to-left algorithms for scalar multiplication. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol.\u00a04727, pp. 135\u2013147. Springer, Heidelberg (2007)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-36400-5_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Joye","year":"2003","unstructured":"Joye, M., Yen, S.-M.: The Montgomery powering ladder. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 291\u2013302. Springer, Heidelberg (2003)"},{"issue":"177","key":"5_CR16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation\u00a048(177), 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.C. Kocher","year":"1999","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"5_CR18","unstructured":"Longa, P.: ECC Point Arithmetic Formulae (EPAF), \n                    \n                      http:\/\/patricklonga.bravehost.com\/Jacobian.html"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-01957-9_5","volume-title":"Applied Cryptography and Network Security","author":"P. Longa","year":"2009","unstructured":"Longa, P., Gebotys, C.H.: Novel precomputation schemes for elliptic curve cryptosystems. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol.\u00a05536, pp. 71\u201388. Springer, Heidelberg (2009)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-78440-1_14","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"P. Longa","year":"2008","unstructured":"Longa, P., Miri, A.: New composite operations and precomputation for elliptic curve cryptosystems over prime fields. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 229\u2013247. Springer, Heidelberg (2008)"},{"key":"5_CR21","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. L\u00f3pez","year":"1999","unstructured":"L\u00f3pez, J., Dahab, R.: Fast multiplication on elliptic curves over GF(2\n                    m\n                  ) without precomputation. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 316\u2013327. Springer, Heidelberg (1999)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-73074-3_15","volume-title":"Arithmetic of Finite Fields","author":"N. Meloni","year":"2007","unstructured":"Meloni, N.: New point addition formul\u00e6 for ECC applications. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 189\u2013201. Springer, Heidelberg (2007)"},{"key":"5_CR23","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":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"issue":"177","key":"5_CR24","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding up the Pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048(177), 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"key":"5_CR25","unstructured":"National Institute of Standards and Technology. Digital Signature Standard (DSS). Federal Information Processing Standards Publication, FIPS PUB 186-3 (June 2009)"},{"issue":"9","key":"5_CR26","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1109\/12.869328","volume":"49","author":"S.-M. Yen","year":"2000","unstructured":"Yen, S.-M., Joye, M.: Checking before output may not be enough against fault-based cryptanalysis. IEEE Transactions on Computers\u00a049(9), 967\u2013970 (2000)","journal-title":"IEEE Transactions on Computers"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","first-page":"414","volume-title":"Information Security and Cryptology - ICISC 2001","author":"S.-M. Yen","year":"2002","unstructured":"Yen, S.-M., Kim, S., Lim, S., Moon, S.-J.: A countermeasure against one physical cryptanalysis may benefit another attack. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol.\u00a02288, pp. 414\u2013427. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems, CHES 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15031-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:58:06Z","timestamp":1558299486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15031-9_5"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642150302","9783642150319"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15031-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}