{"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":1772283568141,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s13389-011-0012-0","type":"journal-article","created":{"date-parts":[[2011,8,8]],"date-time":"2011-08-08T19:05:23Z","timestamp":1312830323000},"page":"161-176","source":"Crossref","is-referenced-by-count":47,"title":["Scalar multiplication on Weierstra\u00df elliptic curves from Co-Z arithmetic"],"prefix":"10.1007","volume":"1","author":[{"given":"Raveen R.","family":"Goundar","sequence":"first","affiliation":[]},{"given":"Marc","family":"Joye","sequence":"additional","affiliation":[]},{"given":"Atsuko","family":"Miyaji","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Rivain","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Venelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,9]]},"reference":[{"issue":"177","key":"12_CR1","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. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) Advances in Cryptology \u2212 CRYPTO\u201985. LNCS, vol. 218, pp. 417\u2013426. Springer, Berlin (1985)","DOI":"10.1007\/3-540-39799-X_31"},{"key":"12_CR3","doi-asserted-by":"crossref","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)","DOI":"10.1201\/9781420034981"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P. (eds.): Advances in Elliptic Curve Cryptography, London Mathematical Society Lecture Note Series, vol. 317. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9780511546570"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Meloni, N.: New point addition formul\u00e6 for ECC applications. In: Carlet, C., Sunar, B. (eds.) Arithmetic of Finite Fields (WAIFI 2007). LNCS, vol. 4547, pp. 189\u2013201. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73074-3_15"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Goundar, R.R., Joye, M., Miyaji, A.: Co-Z addition formul\u00e6 and binary ladders on elliptic curves. In: Mangard, S., Standaert, F.X. (eds.) Cryptographic Hardware and Embedded Systems \u2212 CHES 2010. LNCS, vol. 6225, pp. 65\u201379. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15031-9_5"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1090\/conm\/521\/10271","volume":"521","author":"A. Venelli","year":"2010","unstructured":"Venelli A., Dassance F.: Faster side-channel resistant elliptic curve scalar multiplication. Contemp. Math. 521, 29\u201340 (2010)","journal-title":"Contemp. Math."},{"key":"12_CR8","unstructured":"Rivain, M.: Fast and regular algorithms for scalar multiplication over elliptic curves. Cryptology ePrint Archive, Report 2011\/338 (2011). http:\/\/eprint.iacr.org\/"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) Advances in Cryptology \u2212 CRYPTO\u00a0\u201999. LNCS, vol. 1666, pp. 388\u2013397. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"issue":"9","key":"12_CR10","doi-asserted-by":"crossref","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 Trans. Comput. 49(9), 967\u2013970 (2000)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Yen, S.M., Kim, S., Lim, S., Moon, S.J.: A countermeasure against one physical cryptanalysis may benefit another attack. In: Kim, K. (ed.) Information Security and Cryptology\u2014ICISC 2001. LNCS, vol. 2288, pp. 414\u2013427. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45861-1_31"},{"key":"12_CR12","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database. http:\/\/hyperelliptic.org\/EFD\/g1p\/auto-shortw.html"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta, K., Pei, D. (eds.) Advances in Cryptology\u2014ASIACRYPT\u00a0\u201998. LNCS, vol. 1514, pp. 51\u201365. Springer, Berlin (1998)","DOI":"10.1007\/3-540-49649-1_6"},{"key":"12_CR14","unstructured":"Longa, P.: ECC Point Arithmetic Formulae (EPAF). http:\/\/patricklonga.bravehost.com\/jacobian.html"},{"issue":"4","key":"12_CR15","doi-asserted-by":"crossref","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. Adv. Appl. Math. 7(4), 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Izu, T., M\u00f6ller, B., Takagi, T.: Improved elliptic curve multiplication methods reistant against side-channel attacks. In: Menezes, A., Sarkar, P. (eds.) Progress in Cryptology\u2014INDOCRYPT 2002. LNCS, vol. 2551, pp. 296\u2013313. Springer, Berlin (2002)","DOI":"10.1007\/3-540-36231-2_24"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Coron, J.S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Koc, C.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems (CHES\u201999). LNCS, vol. 1717, pp. 292\u2013302. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48059-5_25"},{"issue":"177","key":"12_CR18","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. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Joye, M., Yen, S.M.: The Montgomery powering ladder. In: Kaliski, B.S. Jr, et\u00a0al. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2002. LNCS, vol. 2523, pp. 291\u2013302. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36400-5_22"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Brier, E., Joye, M.: Weierstra\u00df elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) Public Key Cryptography (PKC 2002) LNCS, vol. 2274, pp. 335\u2013345. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45664-3_24"},{"key":"12_CR21","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. Cryptology ePrint Archive, Report 2002\/007 (2002). http:\/\/eprint.iacr.org\/"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Izu, T., Takagi, T.: A fast parallel elliptic curve multiplication resistant against side channel attacks. In: Naccache, D., Paillier, P. (eds.) Public Key Cryptography (PKC 2002). LNCS, vol. 2274, pp. 280\u2013296. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45664-3_20"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, J., Dahab, R.: Fast multiplication on elliptic curves over GF(2 m ) without precomputation. In: Koc, C.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems (CHES\u201999). LNCS, vol. 1717, pp. 316\u2013327. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48059-5_27"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Joye, M.: Highly regular right-to-left algorithms for scalar multiplication. In: Paillier, P., Verbauwhede, I. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2007. LNCS, vol. 4727, pp. 135\u2013147. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74735-2_10"},{"issue":"6","key":"12_CR25","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F. Morain","year":"1990","unstructured":"Morain F., Olivos J.: Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO Informatique th\u00e9orique et applications 24(6), 531\u2013543 (1990)","journal-title":"RAIRO Informatique th\u00e9orique et applications"},{"key":"12_CR26","unstructured":"Galbraith, S., Lin, X., Scott, M.: A faster way to do ECC. Presented at 12th Workshop on Elliptic Curve Cryptography (ECC 2008), Utrecht, The Netherlands (2008). http:\/\/www.hyperelliptic.org\/tanja\/conf\/ECC08\/slides\/Mike-Scott.pdf"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Longa, P., Gebotys, C.H.: Novel precomputation schemes for elliptic curve cryptosystems. In: Abdalla, M. et\u00a0al. (eds.) Applied Cryptography and Network Security (ACNS 2009). LNCS, vol. 5536, pp. 71\u201388. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01957-9_5"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Longa, P., Miri, A.: New composite operations and precomputation for elliptic curve cryptosystems over prime fields. In: Cramer, R. (ed.) Public Key Cryptography\u2014PKC 2008. LNCS, vol. 4939, pp. 229\u2013247. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-78440-1_14"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Gandolfi, K., Mourtel, C., Olivier, F.: Electromagnetic analysis: Concrete results. In: Ko\u00e7, C.K., Naccache, D., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2001. LNCS, vol. 2162, pp. 251\u2013261. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44709-1_21"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Archambeault, B., Rao, J., Rohatgi, P.: The EM side-channel(s). In: Kaliski, B.S. Jr et\u00a0al. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2002. LNCS, vol. 2523, pp. 29\u201345. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36400-5_4"},{"issue":"6","key":"12_CR31","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1109\/TC.2004.13","volume":"53","author":"B. Chevallier-Mames","year":"2004","unstructured":"Chevallier-Mames B., Ciet M., Joye M.: Low-cost solutions for preventing simple side-channel analysis: Side-channel atomicity. IEEE Trans. Comput. 53(6), 760\u2013768 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Biehl, I., Meyer, B., M\u00fcller, V.: Differential fault attacks on elliptic curve cryptosystems. In: Bellare, M. (ed.) Advances in Cryptology\u2014CRYPTO 2000. LNCS, vol. 1880, pp. 131\u2013146. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44598-6_8"},{"issue":"2","key":"12_CR33","doi-asserted-by":"crossref","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. J. Cryptol. 14(2), 110\u2013119 (2001) Extended abstract in Proc of EUROCRYPT, 97","journal-title":"J. Cryptol."},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Fouque, P.A., Lercier, R., R\u00e9al, D., Valette, F.: Fault attack on elliptic curve Montgomery ladder implementation. In: Breveglieri, L. et\u00a0al. (eds.) Fault Diagnosis and Tolerance in Cryptography (FDTC 2008), pp. 92\u201398. IEEE Computer Society (2008)","DOI":"10.1109\/FDTC.2008.15"},{"key":"12_CR35","unstructured":"IEEE Std 1363-2000: IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society (2000)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-011-0012-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-011-0012-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-011-0012-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T22:32:07Z","timestamp":1560465127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-011-0012-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1007\/s13389-011-0012-0","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}