{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:16Z","timestamp":1772283556667,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540226666","type":"print"},{"value":"9783540286325","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28632-5_11","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:45:31Z","timestamp":1285015531000},"page":"148-162","source":"Crossref","is-referenced-by-count":46,"title":["Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations"],"prefix":"10.1007","author":[{"given":"Roberto Maria","family":"Avanzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"AMD Corporation. AMD-K6-2 Processor Data Sheet, http:\/\/www.amd.com\/us-en\/assets\/content_type\/white_papers_and_tech_docs\/21850.pdf"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-45238-6_29","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"R.M. Avanzi","year":"2003","unstructured":"Avanzi, R.M.: Countermeasures against differential power analysis for hyperelliptic curve cryptosystems. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 366\u2013381. Springer, Heidelberg (2003)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-24654-1_23","volume-title":"Selected Areas in Cryptography","author":"R.M. Avanzi","year":"2004","unstructured":"Avanzi, R.M., Mih\u0103ilescu, P.M.: Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 320\u2013334. Springer, Heidelberg (2004)"},{"key":"11_CR4","unstructured":"Avanzi, R.M.: A note on the sliding window integer recoding and its left-to-right analogue (submitted)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-48329-2_16","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Bosselaers","year":"1994","unstructured":"Bosselaers, A., Govaerts, R., Vandewalle, J.: Comparison of three modular reduction functions. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 175\u2013186. Springer, Heidelberg (1994)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M.K. Brown","year":"2001","unstructured":"Brown, M.K., Hankerson, D., Lopez, J., Menezes, A.: Software implementation of the NIST elliptic curves over prime fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 250\u2013265. Springer, Heidelberg (2001)"},{"key":"11_CR7","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. Math. Comp.\u00a048, 95\u2013101 (1987)","journal-title":"Math. Comp."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/BFb0028484","volume-title":"Information and Communications Security","author":"H. Cohen","year":"1997","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 282\u2013290. Springer, Heidelberg (1997)"},{"key":"11_CR9","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.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1147\/sj.294.0526","volume":"29","author":"P.G. Comba","year":"1990","unstructured":"Comba, P.G.: Exponentiation cryptosystems on the IBM PC. IBM Systems Journal\u00a029, 526\u2013538 (1990)","journal-title":"IBM Systems Journal"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-46877-3_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"S.R. Duss\u00e9","year":"1991","unstructured":"Duss\u00e9, S.R., Kaliski Jr., B.S.: A cryptographic library for the motorola DSP 56000. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 230\u2013244. Springer, Heidelberg (1991)"},{"key":"11_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":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24676-3_15","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P. Gaudry","year":"2004","unstructured":"Gaudry, P., Schost, E.: Construction of Secure Random Curves of Genus 2 over Prime Fields. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 239\u2013256. Springer, Heidelberg (2004)"},{"key":"11_CR14","unstructured":"Gonda, M., Matsuo, K., Aoki, K., Chao, J., Tsuji, S.: Improvements of addition algorithm on genus 3 hyperelliptic curves and their implementations. In: Proc. SCIS 2004, pp. 995\u20131000 (2004)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D.M. Gordon","year":"1998","unstructured":"Gordon, D.M.: A survey of fast exponentiation methods. J. of Algorithms\u00a027, 129\u2013146 (1998)","journal-title":"J. of Algorithms"},{"key":"11_CR16","unstructured":"Grandlund, T.: GMP. A software library for arbitrary precision integers, Available from: http:\/\/www.swox.com\/gmp\/"},{"key":"11_CR17","unstructured":"Harley, R.: Fast Arithmetic on Genus Two Curves, Available at http:\/\/cristal.inria.fr\/~harley\/hyper\/"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Jebelean, T.: A Generalization of the Binary GCD Algorithm. In: Proc. ISSAC 1993, pp. 111\u2013116 (1993)","DOI":"10.1145\/164081.164102"},{"issue":"8","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"B.S. Kaliski Jr.","year":"1995","unstructured":"Kaliski Jr., B.S.: The Montgomery inverse and its applications. IEEE Transactions on Computers\u00a044(8), 1064\u20131065 (1995)","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR20","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Soviet Physics - Doklady\u00a07, 595\u2013596 (1963)","journal-title":"Soviet Physics - Doklady"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic Cryptosystems. J. of Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"J. of Cryptology"},{"key":"11_CR22","unstructured":"Krieger, U.: signature.c: Anwendung hyperelliptischer Kurven in der Kryptographie. M.S. Thesis, Mathematik und Informatik, Universit\u00e4t Essen, Fachbereich 6, Essen, Germany"},{"key":"11_CR23","unstructured":"Lange, T.: Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. Cryptology ePrint Archive, Report 2002\/121 (2002), http:\/\/eprint.iacr.org\/"},{"key":"11_CR24","unstructured":"Lange, T.: Formulae for Arithmetic on Genus 2 Hyperelliptic Curves. To appear in: J. AAECC"},{"key":"11_CR25","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting Cryptographic Key Sizes. J. of Cryptology\u00a014, 255\u2013293 (2001)","journal-title":"J. of Cryptology"},{"key":"11_CR26","unstructured":"Lercier, R.: Algorithmique des courbes elliptiques dans les corps finis. These, Available from http:\/\/www.medicis.polytechnique.fr\/~lercier\/"},{"key":"11_CR27","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(2m). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 405\u2013421. Springer, Heidelberg (2000)"},{"key":"11_CR28","volume-title":"Algebraic aspects of cryptography","author":"A. Menezes","year":"1998","unstructured":"Menezes, A., Wu, Y.-H., Zuccherato, R.: An Elementary Introduction to Hyperelliptic Curves. In: Koblitz, N. (ed.) Algebraic aspects of cryptography, Springer, Heidelberg (1998)"},{"key":"11_CR29","first-page":"313","volume":"94","author":"J.-F. Mestre","year":"1991","unstructured":"Mestre, J.-F.: Construction des courbes de genre 2 a partir de leurs modules. Progr. Math.\u00a094, 313\u2013334 (1991)","journal-title":"Progr. Math."},{"key":"11_CR30","unstructured":"Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., Tsuji, S.: A Fast Addition Algorithm of Genus Two Hyperelliptic Curve. In: Proc. SCIS 2002, IEICE Japan, pp. 497\u2013502 (2002) (in Japanese)"},{"key":"11_CR31","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comp.\u00a044, 519\u2013521 (1985)","journal-title":"Math. Comp."},{"key":"11_CR32","unstructured":"Pelzl, J.: Fast Hyperelliptic Curve Cryptosystems for Embedded Processors. Master\u2019s Thesis. Dept. of Elec. Eng. and Infor. Sci., Ruhr-University of Bochum (2002)"},{"key":"11_CR33","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":"11_CR34","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G.W. Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.W.: Binary arithmetic. Advances in Computers\u00a01, 231\u2013308 (1960)","journal-title":"Advances in Computers"},{"key":"11_CR35","unstructured":"Sakai, Y., Sakurai, K.: On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation. IEICE-Tran. Fund. Elec., Comm. and Comp. Sci.\u00a0E83-A(4), 692\u2013703"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-48910-X_12","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"N.P. Smart","year":"1999","unstructured":"Smart, N.P.: On the Performance of Hyperelliptic Cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 165\u2013175. Springer, Heidelberg (1999)"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J.A. Solinas","year":"1997","unstructured":"Solinas, J.A.: An improved algorithm for arithmetic on a family of elliptic curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 357\u2013371. Springer, Heidelberg (1997)"},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-40061-5_5","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"N. Th\u00e9riault","year":"2003","unstructured":"Th\u00e9riault, N.: Index calculus attack for hyperelliptic curves of small genus. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 75\u201392. Springer, Heidelberg (2003)"},{"key":"11_CR39","unstructured":"Weng, A.: Konstruktion kryptographisch geeigneter Kurven mit komplexer Multiplikation. PhD thesis, Universit\u00e4t Gesamthochschule Essen (2001)"},{"key":"11_CR40","unstructured":"Wollinger, T., Pelzl, J., Wittelsberger, V., Paar, C., Saldamli, G., Ko\u00e7, \u00c7.K.: Elliptic & Hyperelliptic Curves on Embedded \u03bc P. Special issue on Embedded Systems and Security of the ACM Transactions in Embedded Computing Systems"},{"key":"11_CR41","unstructured":"Wollinger, T.: Engineering Aspects of Hyperelliptic Curves. Ph.D. Thesis. Dept. of Elec. Eng. and Infor. Sci., Ruhr-University of Bochum (July 2004)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28632-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:26:05Z","timestamp":1605759965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28632-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226666","9783540286325"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28632-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}