{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:27Z","timestamp":1772283567591,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319083018","type":"print"},{"value":"9783319083025","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08302-5_12","type":"book-chapter","created":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T09:40:41Z","timestamp":1403689241000},"page":"171-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Revisiting Atomic Patterns for Scalar Multiplications on Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Franck","family":"Rondepierre","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,26]]},"reference":[{"issue":"8","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/12.238495","volume":"42","author":"S Arno","year":"1993","unstructured":"Arno, S., Wheeler, F.: Signed digit representations of minimal Hamming weight. IEEE Trans. Comput. 42(8), 1007\u20131009 (1993)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Brier, E., Joye, M.: Weierstra\u00df elliptic curves and side-channel attacks. In: Naccache and Paillier [25], pp. 335\u2013345","DOI":"10.1007\/3-540-45664-3_24"},{"key":"12_CR3","unstructured":"Chevallier-Mames, B., Ciet, M., Joye, M.: Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity. Cryptology ePrint Archive, Report 2003\/237 (2003). http:\/\/eprint.iacr.org\/"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"DV Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers genereated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math. 7, 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"key":"12_CR5","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. 1514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"12_CR6","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. 1717, pp. 292\u2013302. Springer, Heidelberg (1999)"},{"key":"12_CR7","unstructured":"ECC Brainpool: ECC brainpool standard curves and curve generation. BSI, internet Draft v. 3, (2009). http:\/\/tools.ietf.org\/html\/draft-lochter-pkix-brainpool-ecc-03"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public-key cryptosystems and a signature scheme based on discret logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-35999-6_17","volume-title":"Selected Areas in Cryptography","author":"J-C Faug\u00e8re","year":"2013","unstructured":"Faug\u00e8re, J.-C., Goyet, C., Renault, G.: Attacking (EC)DSA given only an implicit hint. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 252\u2013274. Springer, Heidelberg (2013)"},{"key":"12_CR10","unstructured":"FIPS PUB 186\u20134: Digital Signature Standard. National Institute of Standards and Technology, July 2013"},{"key":"12_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, Jan 2002. http:\/\/eprint.iacr.org\/"},{"key":"12_CR12","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. 6035, pp. 80\u2013101. Springer, Heidelberg (2010)"},{"key":"12_CR13","unstructured":"Giry, D., Bulens, P.: Keylength.com - Cryptographic Key Length Recommandation, Aug 2007. http:\/\/www.keylength.com"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","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., Venelli, A.: Scalar multiplication on weierstra\u00df elliptic curves from co- z arithmetic. J. Cryptol. 1(2), 161\u2013176 (2011)","journal-title":"J. Cryptol."},{"key":"12_CR15","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography: Professional Computing Series. Springer, New York (2003)"},{"key":"12_CR16","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":"12_CR17","unstructured":"ISO\/IEC JTC1 SC17 WG3\/TF5: Supplemental Access Control for Machine Readable Travel Documents. International Civial Aviation Organization, Nov 2010"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Izu, T., Takagi, T.: A fast parallel elliptic curve multiplication resistant against side channel attacks. In: Naccache and Paillier [25], pp. 280\u2013296","DOI":"10.1007\/3-540-45664-3_20"},{"key":"12_CR19","unstructured":"JORF n: Avis relatif aux param\u00e8tres de courbes elliptiques d\u00e9finis par l\u2019\u00c9tat fran\u00e7ais, Oct 2011"},{"key":"12_CR20","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 2, 3rd edn. Addison Wesley, Reading (1988)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"12_CR22","unstructured":"Longa, P.: Accelerating the scalar multiplication on elliptic curve cryptosystems over prime fields. Master\u2019s thesis, School of Information Technology and Engineering, University of Ottawa, Canada (2007)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36552-4_21","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B M\u00f6ller","year":"2003","unstructured":"M\u00f6ller, B.: Improved techniques for fast exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 298\u2013312. Springer, Heidelberg (2003)"},{"issue":"170","key":"12_CR24","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P Montgomery","year":"1985","unstructured":"Montgomery, P.: Modular multiplication without trial division. Math. Comp. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comp."},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography","year":"2002","unstructured":"Naccache, D., Paillier, P. (eds.): PKC 2002. LNCS, vol. 2274. Springer, Heidelberg (2002)"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-12827-1_6","volume-title":"Information Security, Practice and Experience","author":"K Okeya","year":"2010","unstructured":"Okeya, K., Kato, H., Nogami, Y.: Width-3 joint sparse form. In: Kwak, J., Deng, R.H., Won, Y., Wang, G. (eds.) ISPEC 2010. LNCS, vol. 6047, pp. 67\u201384. Springer, Heidelberg (2010)"},{"issue":"2","key":"12_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"12_CR28","unstructured":"Solinas, J.: Low-Weight Binary Representations for Pairs of Integers. Technical report (2001). http:\/\/cacr.uwaterloo.ca\/techreports\/2001\/corr2001-41.ps"},{"issue":"2\/3","key":"12_CR29","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"JA Solinas","year":"2000","unstructured":"Solinas, J.A.: Efficient arithmetic on koblitz curves. Des. Codes Crypt. 19(2\/3), 195\u2013249 (2000)","journal-title":"Des. Codes Crypt."},{"key":"12_CR30","first-page":"806","volume":"70","author":"EG Straus","year":"1964","unstructured":"Straus, E.G.: Addition chains of vectors (problem 5125). Am. Math. Monthly 70, 806\u2013808 (1964)","journal-title":"Am. Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","Smart Card Research and Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08302-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T03:58:15Z","timestamp":1703217495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08302-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319083018","9783319083025"],"references-count":30,"aliases":["10.1007\/978-3-319-14123-7_12"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08302-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 June 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}