{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:15:52Z","timestamp":1778264152814,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,16]],"date-time":"2012-10-16T00:00:00Z","timestamp":1350345600000},"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":[[2012,11]]},"DOI":"10.1007\/s13389-012-0042-2","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T13:31:53Z","timestamp":1350480713000},"page":"221-240","source":"Crossref","is-referenced-by-count":18,"title":["Co- $$Z$$ ECC scalar multiplications for hardware, software and hardware\u2013software co-design on embedded systems"],"prefix":"10.1007","volume":"2","author":[{"given":"Brian","family":"Baldwin","sequence":"first","affiliation":[]},{"given":"Raveen R.","family":"Goundar","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Hamilton","sequence":"additional","affiliation":[]},{"given":"William P.","family":"Marnane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,16]]},"reference":[{"key":"42_CR1","unstructured":"National Institute of Advanced Industrial Science and Technology (AIST), Research Center for Information Security (RCIS), Sidechannel Attack Standard, Evaluation Board (SASEBO) (2009)"},{"key":"42_CR2","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":"42_CR3","unstructured":"Avanzi, R.M.: Side channel attacks on implementations of curve-based cryptographic primitives. Cryptology ePrint Archive, Report 2005\/017 (2005). http:\/\/eprint.iacr.org\/"},{"key":"42_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":"42_CR5","doi-asserted-by":"crossref","unstructured":"Brier, E., Joye, M.: Weierstra\u00df Elliptic curve and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) Public key cryptography\u2014PKC 2002. Lecture Notes in Computer Science, vol. 2274, pp. 335\u2013345. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45664-3_24"},{"issue":"2","key":"42_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1504\/IJHPSA.2007.015399","volume":"1","author":"A Byrne","year":"2007","unstructured":"Byrne, A., Meloni, N., Crowe, F., Marnane, W.P., Tisserand, A., Popovici, E.M.: SPA resistant elliptic curve cryptosystem using addition chains. Int. J. High Perform. Syst. Archit. 1(2), 133\u2013142 (2007)","journal-title":"Int. J. High Perform. Syst. Archit."},{"key":"42_CR7","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Roussellet, M., Verneuil, V.: Square always exponentiation. In: Springer (ed.) 12th International Conference on Cryptology in India\u2014INDOCRYPT 2011. LNCS, Chennai, India (2011). http:\/\/hal.inria.fr\/inria-00633545"},{"key":"42_CR8","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 \u201998. Lecture Notes in Computer Science, vol. 1514, pp. 51\u201365. Springer, Berlin (1998)","DOI":"10.1007\/3-540-49649-1_6"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Coron, J.S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems (CHES \u201999). Lecture Notes in Computer Science, vol. 1717, pp. 292\u2013302. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48059-5_25"},{"key":"42_CR10","unstructured":"European Network of Excellence in Cryptology II: ECRYPT II Yearly Report on Algorithms and Keysizes (2010)"},{"key":"42_CR11","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":"42_CR12","unstructured":"Galbraith, S., Lin, X., Scott, M.: A faster way to do ECC. In: Presented at 12th Workshop on Elliptic Curve Cryptography (ECC 2008), Utrecht, The Netherlands (2008). Slides available at URL http:\/\/www.hyperelliptic.org\/tanja\/conf\/ECC08\/slides\/Mike-Scott.pdf"},{"key":"42_CR13","unstructured":"Giraud, C., Verneuil, V.: Atomicity improvement for elliptic curve scalar multiplication. Computing Research Repository abs\/1002.4, 80\u2013101 (2010). doi: 10.1007\/978-3-642-12510-2-7"},{"key":"42_CR14","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\u2014CHES 2010. Lecture Notes in Computer Science, vol. 6225, pp. 65\u201379. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15031-9_5"},{"key":"42_CR15","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). http:\/\/eprint.iacr.org\/"},{"issue":"2","key":"42_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s13389-011-0012-0","volume":"1","author":"RR Goundar","year":"2011","unstructured":"Goundar, R.R., Joye, M., Miyaji, A., Rivain, M., Vanelli, A.: A scalar multiplication on weierstra\u00df elliptic curves from co- $$z$$ arithmetic. J. Cryptogr. Eng. 1(2), 161\u2013176 (2011)","journal-title":"J. Cryptogr. Eng."},{"key":"42_CR17","doi-asserted-by":"crossref","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. Lecture Notes in Computer Science, vol. 6737, pp. 170\u2013187. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-21969-6_11"},{"key":"42_CR18","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. Lecture Notes in Computer Science, vol. 2551, pp. 296\u2013313. Springer, Berlin (2002)","DOI":"10.1007\/3-540-36231-2_24"},{"key":"42_CR19","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). Lecture Notes in Computer Science, vol. 2274, pp. 280\u2013296. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45664-3_20"},{"key":"42_CR20","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. Lecture Notes in Computer Science, vol. 4727, pp. 135\u2013147. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74735-2_10"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Joye, M., Yen, S.M.: The Montgomery powering ladder. In: Kaliski, B.S. Jr., et al. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES 2002. Lecture Notes in Computer Science, vol. 2523, pp. 291\u2013302. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36400-5_22"},{"issue":"177","key":"42_CR22","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":"42_CR23","doi-asserted-by":"crossref","unstructured":"Kocher, P.C.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. pp. 104\u2013113. Springer, Berlin (1996)","DOI":"10.1007\/3-540-68697-5_9"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) Advances in Cryptology\u2014CRYPTO \u201999. Lecture Notes in Computer Science, vol. 1666, pp. 388\u2013397. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Longa, P., Gebotys, C.H.: Novel precomputation schemes for elliptic curve cryptosystems. In: Abdalla, M., et al. (eds.) Applied Cryptography and Network Security (ACNS 2009). Lecture Notes in Computer Science, vol. 5536, pp. 71\u201388. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01957-9_5"},{"key":"42_CR26","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. Lecture Notes in Computer Science, vol. 4939, pp. 229\u2013247. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-78440-1_14"},{"key":"42_CR27","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, J., Dahab, R.: Fast multiplication on elliptic curves over $${GF}(2^m)$$ without precomputation. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems (CHES \u201999). Lecture Notes in Computer Science, vol. 1717, pp. 316\u2013327. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48059-5_27"},{"key":"42_CR28","doi-asserted-by":"crossref","first-page":"1946","DOI":"10.1109\/TCSI.2006.880184","volume":"53","author":"CJ McIvor","year":"2006","unstructured":"McIvor, C.J., McLoone, M., McCanny, J.V.: Hardware elliptic curve cryptographic processor over GF( $$p$$ ). IEEE Trans. Circuits Syst. 53, 1946\u20131957 (2006)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"42_CR29","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). Lecture Notes in Computer Science, vol. 4547, pp. 189\u2013201. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73074-3_15"},{"key":"42_CR30","doi-asserted-by":"crossref","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) Advances in Cryptology\u2014CRYPTO \u201985. Lecture Notes in Computer Science, vol. 218, pp. 417\u2013426. Springer, Berlin (1985)","DOI":"10.1007\/3-540-39799-X_31"},{"key":"42_CR31","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985)","journal-title":"Math. Comput."},{"issue":"177","key":"42_CR32","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL 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":"42_CR33","unstructured":"NIST: Advanced Encryption Standard (AES) (FIPS-197). National Institute of Standards and Technology (2001)"},{"key":"42_CR34","unstructured":"NIST: Recommendation for Key Management-Part 1 (2007)"},{"key":"42_CR35","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-44709-1_29","volume":"2162","author":"G Orlando","year":"2001","unstructured":"Orlando, G., Paar, C.: A scalable gf(p) elliptic curve processor architecture for programmable hardware. Lect. Notes Comput. Sci. 2162, 348\u2013363 (2001)","journal-title":"Lect. Notes Comput. Sci."},{"key":"42_CR36","unstructured":"Research, C.: Sec 2: Recommended elliptic curve domain, parameters (2000)"},{"key":"42_CR37","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":"42_CR38","unstructured":"Slla, A.M., Drabek, V.: An efficient list-based scheduling algorithm for high-level synthesis. In: Proceedings of the Euromicro Symposium on Digital Systems Design, pp. 316\u2013323. IEEE Computer Society, New York (2002)"},{"key":"42_CR39","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."},{"issue":"21","key":"42_CR40","doi-asserted-by":"crossref","first-page":"1831","DOI":"10.1049\/el:19991230","volume":"35","author":"CD Walter","year":"1999","unstructured":"Walter, C.D.: Montgomery exponentiation needs no final subtractions. Electron. Lett. 35(21), 1831\u20131832 (1999)","journal-title":"Electron. Lett."},{"key":"42_CR41","unstructured":"Xilinx: Microblaze soft processor core. http:\/\/www.xilinx.com\/tools\/microblaze.htm"},{"issue":"9","key":"42_CR42","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1109\/12.869328","volume":"49","author":"SM 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":"42_CR43","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. Lecture Notes in Computer Science, vol. 2288, pp. 414\u2013427. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45861-1_31"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-012-0042-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-012-0042-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-012-0042-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T15:21:47Z","timestamp":1562253707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-012-0042-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,16]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s13389-012-0042-2","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,16]]}}}