{"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":1772283568119,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642219689","type":"print"},{"value":"9783642219696","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21969-6_11","type":"book-chapter","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T15:41:28Z","timestamp":1309275688000},"page":"170-187","source":"Crossref","is-referenced-by-count":29,"title":["Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hutter","sequence":"first","affiliation":[]},{"given":"Marc","family":"Joye","sequence":"additional","affiliation":[]},{"given":"Yannick","family":"Sierra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"11_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TC.1983.1676262","volume":"32","author":"G.R. Blakely","year":"1983","unstructured":"Blakely, G.R.: A computer algorithm for calculating the product ab modulo m. IEEE Transactions on Computers\u00a032(5), 497\u2013500 (1983)","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR2","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)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-44828-4_6","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"E. Brier","year":"2003","unstructured":"Brier, E., Joye, M.: Fast point multiplication on elliptic curves through isogenies. In: Fossorier, M., H\u00f8holdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol.\u00a02643, pp. 43\u201350. Springer, Heidelberg (2003)"},{"key":"11_CR4","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":"11_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/FDTC.2009.35","volume-title":"Fault Diagnosis and Tolerance in Cryptography (FDTC 2009)","author":"N.M. Ebeid","year":"2009","unstructured":"Ebeid, N.M., Lambert, R.: Securing the elliptic curve Montgomery ladder against fault attacks. In: Breveglieri, L., et al. (eds.) Fault Diagnosis and Tolerance in Cryptography (FDTC 2009), pp. 46\u201350. IEEE Computer Society, Los Alamitos (2009)"},{"key":"11_CR6","unstructured":"Explicit-formulas database (EFD), \n                    \n                      http:\/\/www.hyperelliptic.org\/EFD\/"},{"key":"11_CR7","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)"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/FDTC.2008.15","volume-title":"Fault Diagnosis and Tolerance in Cryptography (FDTC 2008)","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 2008), pp. 92\u201398. IEEE Computer Society, Los Alamitos (2008)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-12510-2_7","volume-title":"Smart Card Research and Advanced Application","author":"C. Giraud","year":"2010","unstructured":"Giraud, C., Verneuil, V.: Atomicity improvement for elliptic curve scalar multiplication. In: Gollmann, D., Lanet, J.-L., Iguchi-Cartigny, J. (eds.) CARDIS 2010. LNCS, vol.\u00a06035, pp. 80\u2013101. Springer, Heidelberg (2010)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-15031-9_5","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"R.R. Goundar","year":"2010","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.) CHES 2010. LNCS, vol.\u00a06225, pp. 65\u201379. Springer, Heidelberg (2010)"},{"key":"11_CR11","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"11_CR12","unstructured":"Hein, D., Wolkerstorfer, J., Felber, N.: ECC is ready for RFID \u2013 A proof in silicon. In: 4th Workshop on RFID Security 2008 (RFIDsec 2008), July 9\u201311 (2008)"},{"key":"11_CR13","unstructured":"IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society (August 2000)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-36231-2_24","volume-title":"Progress in Cryptology - INDOCRYPT 2002","author":"T. Izu","year":"2002","unstructured":"Izu, T., M\u00f6ller, B., Takagi, T.: Improved elliptic curve multiplication methods resistant against side channel attacks. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol.\u00a02551, pp. 296\u2013313. Springer, Heidelberg (2002)"},{"key":"11_CR15","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":"11_CR16","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)"},{"key":"11_CR17","doi-asserted-by":"publisher","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, 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"key":"11_CR18","unstructured":"Ko\u00e7, \u00c7.K.: RSA Hardware Implementation. Technical report, RSA Laboratories, RSA Data Security, Inc. 100 Marine Parkway, Suite 500 Redwood City, CA 94065-1031 (1995)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7.K. Ko\u00e7","year":"1996","unstructured":"Ko\u00e7, \u00c7.K., Acar, T., Kaliski Jr., B.S.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro.\u00a016, 26\u201333 (1996)","journal-title":"IEEE Micro."},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P. Kocher","year":"1999","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"issue":"11","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/TC.2008.148","volume":"57","author":"Y.K. Lee","year":"2008","unstructured":"Lee, Y.K., Sakiyama, K., Batina, L., Verbauwhede, I.: Elliptic-curve-based security processor for RFID. IEEE Transactions on Computers\u00a057(11), 1514\u20131527 (2008)","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-77535-5_9","volume-title":"Information Security Applications","author":"Y.K. Lee","year":"2008","unstructured":"Lee, Y.K., Verbauwhede, I.: A compact architecture for montgomery elliptic curve scalar multiplication processor. In: Kim, S., Yung, M., Lee, H.-W. (eds.) WISA 2007. LNCS, vol.\u00a04867, pp. 115\u2013127. Springer, Heidelberg (2008)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-46588-1_27","volume-title":"Public Key Cryptography","author":"C.H. Lim","year":"2000","unstructured":"Lim, C.H., Hwang, H.S.: Fast implementation of elliptic curve arithmetic in GF(p\n                           n). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 405\u2013421. Springer, Heidelberg (2000)"},{"key":"11_CR24","volume-title":"Power Analysis Attacks \u2013 Revealing the Secrets of Smartcards","author":"S. Mangard","year":"2007","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power Analysis Attacks \u2013 Revealing the Secrets of Smartcards. Springer, Heidelberg (2007)"},{"key":"11_CR25","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 formulae for ECC applications. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 189\u2013201. Springer, Heidelberg (2007)"},{"key":"11_CR26","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"11_CR27","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":"11_CR28","doi-asserted-by":"publisher","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":"11_CR29","unstructured":"National Institute of Standards and Technology. FIPS 186-3 \u2013 Digital Signature Standard (DSS) (June 2009), \n                    \n                      http:\/\/csrc.nist.gov\/publications\/fips\/fips186-3\/fips_186-3.pdf"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"11_CR31","unstructured":"Schmidt, J.-M.: Implementation Attacks \u2013 Manipulating Devices to Reveal Their Secrets. PhD thesis, Graz University of Technology (2009)"},{"key":"11_CR32","unstructured":"Skorobogatov, S.P.: Semi-Invasive Attacks \u2013 A New Approach to Hardware Security Analysis. PhD thesis, University of Cambridge (2005), \n                    \n                      http:\/\/www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-630.pdf"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/TC.1985.1676574","volume":"34","author":"K.R. Sloan","year":"1985","unstructured":"Sloan, K.R.: Comments on \u201cA computer algorithm for calculating the product AB modulo M\u201d. IEEE Transactions on Computers\u00a034, 290\u2013292 (1985)","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-36400-5_36","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"J. Wolkerstorfer","year":"2003","unstructured":"Wolkerstorfer, J.: Dual-field arithmetic unit for GF(p) and GF(2\n                    m\n                  ). In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 500\u2013514. Springer, Heidelberg (2003)"},{"issue":"9","key":"11_CR35","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"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2011"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21969-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:01:05Z","timestamp":1558296065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21969-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219689","9783642219696"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21969-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}