{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:35:36Z","timestamp":1742384136097},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408338"},{"type":"electronic","value":"9783540452386"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45238-6_29","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T20:04:43Z","timestamp":1277323483000},"page":"366-381","source":"Crossref","is-referenced-by-count":13,"title":["Countermeasures against Differential Power Analysis for Hyperelliptic Curve Cryptosystems"],"prefix":"10.1007","author":[{"given":"Roberto M.","family":"Avanzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"G.B. Agnew","year":"1993","unstructured":"Agnew, G.B., Mullin, R.C., Vanstone, S.A.: An Implementation of Elliptic Curve Cryptosystems over \n                    \n                      \n                    \n                    $$\nF_{2^{155} } \n$$\n                  . IEEE Journal on Selected Areas in Communications\u00a011(2), 804\u2013813 (1993)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"29_CR2","unstructured":"Bellezza, A.: Countermeasures against Side-Channel Attacks for Elliptic Curve Cryptosystems. Cryptology ePrint Archive, Report 2001\/103, Available from \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Brier, E., Joye, M.: Weierstrass Elliptic Curves and Side-Channel Attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 335\u2013345. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45664-3_24"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"D. Cantor","year":"1987","unstructured":"Cantor, D.: Computing in the jacobian of a hyperelliptic curve. Mathematics of Computation\u00a048, 95\u2013101 (1987)","journal-title":"Mathematics of Computation"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D.V. Chudnovsky","year":"1987","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factoring tests. Advances in Applied Mathematics\u00a07, 385\u2013434 (1987)","journal-title":"Advances in Applied Mathematics"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-44709-1_25","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"C. Clavier","year":"2001","unstructured":"Clavier, C., Joye, M.: Universal exponentiation algorithm - a first step towards provable SPA-resistance. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 300\u2013308. Springer, Heidelberg (2001)"},{"key":"29_CR7","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":"29_CR8","unstructured":"Fischer, W., Giraud, C., Knudsen, E.W., Seifert, J.-P.: Parallel Scalar Multiplication on General Elliptic Curves over Fp hedged against Differential Side Channel Attacks. Cryptology ePrint Archive, Report 2002\/007 (2002), Available from \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"29_CR9","unstructured":"Frey, G.: How to disguise an elliptic curve (Weil descent). Talk at ECC 1998, Waterloo (1998), Slides available from \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca\/conferences\/1998\/ecc98\/slides.html"},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/978-3-642-56755-1_13","volume-title":"Finite fields and applications (Augsburg, 1999)","author":"G. Frey","year":"2001","unstructured":"Frey, G.: Applications of arithmetical geometry to cryptographic constructions. In: Finite fields and applications (Augsburg, 1999), pp. 128\u2013161. Springer, Heidelberg (2001)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-45682-1_29","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"S.D. Galbraith","year":"2001","unstructured":"Galbraith, S.D.: Supersingular curves in cryptography. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 495\u2013513. Springer, Heidelberg (2001)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P.: An algorithm for solving the discrete log problem on hyperelliptic curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 19\u201334. Springer, Heidelberg (2000)"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-36288-6_15","volume-title":"Public Key Cryptography - PKC 2003","author":"L. Goubin","year":"2002","unstructured":"Goubin, L.: A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 199\u2013211. Springer, Heidelberg (2002)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-36288-6_17","volume-title":"Public Key Cryptography - PKC 2003","author":"T. Izu","year":"2002","unstructured":"Izu, T., Takagi, T.: Exceptional procedure attackon elliptic curve cryptosystems. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 224\u2013239. Springer, Heidelberg (2002)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","first-page":"412","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"M. Joye","year":"2001","unstructured":"Joye, M., Quisquater, J.-J.: Hessian Elliptic Curves and Side-Channel Attacks. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 412\u2013420. Springer, Heidelberg (2001)"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-44709-1_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"M. Joye","year":"2001","unstructured":"Joye, M., Tymen, C.: Protections against Differential Analysis for Elliptic Curve Cryptography \u2013 An Algebraic Approach. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 377\u2013390. Springer, Heidelberg (2001)"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/0-387-34799-2_8","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"N. Koblitz","year":"1990","unstructured":"Koblitz, N.: A family of Jacobians suitable for discrete log cryptosystems. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 94\u201399. Springer, Heidelberg (1990)"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic Cryptosystems. Journal of Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"Journal of Cryptology"},{"key":"29_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03642-6","volume-title":"Algebraic aspects of cryptography","author":"N. Koblitz","year":"1998","unstructured":"Koblitz, N.: Algebraic aspects of cryptography. Springer, Heidelberg (1998)"},{"key":"29_CR20","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":"P.C. 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.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"29_CR21","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Introduction to Differential Power Analysis and Related Attacks (1998), Available from \n                    \n                      http:\/\/www.cryptography.com\/dpa\/technical"},{"key":"29_CR22","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. 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)"},{"key":"29_CR23","unstructured":"Kuroki, J., Gonda, M., Matsuo, K., Chao, J., Tsujii, S.: Fast Genus Three Hyperelliptic Curve Cryptosystems. In: The 2002 Symposium on Cryptography and Information Security, Japan - SCIS 2002, January 29\u2013Feruary 1 (2002)"},{"key":"29_CR24","unstructured":"Lange, T.: Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. Cryptology ePrint Archive, Report 2002\/121, Available from \n                    \n                      http:\/\/eprint.iacr.org\/\n                    \n                    \n                  \u2013 See also [27]"},{"key":"29_CR25","unstructured":"Lange, T.: Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002\/147, Available from \n                    \n                      http:\/\/eprint.iacr.org\/\n                    \n                    \n                   \u2013 See also [27]"},{"key":"29_CR26","unstructured":"Lange, T.: Weighted Coordinates on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002\/153, Available from \n                    \n                      http:\/\/eprint.iacr.org\/\n                    \n                    \n                   \u2013 See also [27]"},{"key":"29_CR27","unstructured":"Lange, T.: Formulae for Arithmetic on Genus 2 Hyperelliptic Curves, It partially contains and extends the material of the previous three papers [24, 25,26], Available from \n                    \n                      http:\/\/www.ruhr-uni-bochum.de\/itsc\/tanja\/\n                    \n                    \n                   (Preprint)"},{"key":"29_CR28","series-title":"Lecture Notes in Computer Science","first-page":"401","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"P.-Y. Liardet","year":"2001","unstructured":"Liardet, P.-Y., Smart, N.P.: Preventing SPA\/DPA in ECC system using the Jacobi Form. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 401\u2013411. Springer, Heidelberg (2001)"},{"issue":"2","key":"29_CR29","doi-asserted-by":"publisher","first-page":"729","DOI":"10.2307\/2154650","volume":"342","author":"P. Lockhart","year":"1994","unstructured":"Lockhart, P.: On the discriminant of a hyperelliptic curve. Trans. Amer. Math. Soc.\u00a0342(2), 729\u2013752 (1994)","journal-title":"Trans. Amer. Math. Soc."},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, J., Dahab, R.: Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 316\u2013327. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48059-5_27"},{"key":"29_CR31","unstructured":"Menezes, A., Wu, Y.-H., Zuccherato, R.: An Elementary Introduction to Hyperelliptic Curves. In: [19]"},{"key":"29_CR32","unstructured":"Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., Tsuji, S.: A fast addition algorithm of genus two hyperelliptic curve. In: Proceedings of SCIS 2002, pp. 497\u2013502. IEICE, Japan (2002) (in Japanese)"},{"key":"29_CR33","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 the Pollard and Elliptic Curve Methods for Factorizations. Mathematics of Computation\u00a048, 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"key":"29_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45439-X_22","volume-title":"Information Security","author":"B. M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B.: Securing Elliptic Curve Point Multiplication against Side-Channel Attacks. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 324\u2013334. Springer, Heidelberg (2001)"},{"key":"29_CR35","volume-title":"Tata Lectures on Theta II","author":"D. Mumford","year":"1984","unstructured":"Mumford, D.: Tata Lectures on Theta II. Birkh\u00e4user, Basel (1984)"},{"key":"29_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-44495-5_16","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"K. Okeya","year":"2000","unstructured":"Okeya, K., Sakurai, K.: Power analysis breaks elliptic curve cryptosystems even secure against the timing attack. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 178\u2013190. Springer, Heidelberg (2000)"},{"key":"29_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-46588-1_17","volume-title":"Public Key Cryptography","author":"K. Okeya","year":"2000","unstructured":"Okeya, K., Kurumatani, H., Sakurai, K.: Elliptic curves with the Montgomery\u2013form and their cryptographic applications. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 238\u2013257. Springer, Heidelberg (2000)"},{"key":"29_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-45238-6_28","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"J. Pelzl","year":"2003","unstructured":"Pelzl, J., Wollinger, T., Guajardo, J., Paar, C.: Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 351\u2013365. Springer, Heidelberg (2003)"},{"key":"29_CR39","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1155\/S1073792802111160","volume":"17","author":"J. Scholten","year":"2002","unstructured":"Scholten, J., Zhu, H.J.: Hyperelliptic curves in characteristic 2. Inter. Math. Research Notices\u00a017, 905\u2013917 (2002)","journal-title":"Inter. Math. Research Notices"},{"key":"29_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-44709-1_11","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"N.P. Smart","year":"2001","unstructured":"Smart, N.P.: The Hessian Form of an Elliptic Curve. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 118\u2013125. Springer, Heidelberg (2001)"},{"key":"29_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45760-7_5","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"C.D. Walter","year":"2002","unstructured":"Walter, C.D.: MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 53\u201366. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45238-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:07:09Z","timestamp":1558422429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45238-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408338","9783540452386"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45238-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}