{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:18Z","timestamp":1772283558668,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540213703","type":"print"},{"value":"9783540246541","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24654-1_1","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T12:49:37Z","timestamp":1294404577000},"page":"1-16","source":"Crossref","is-referenced-by-count":14,"title":["Low Cost Security: Explicit Formulae for Genus-4 Hyperelliptic Curves"],"prefix":"10.1007","author":[{"given":"Jan","family":"Pelzl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Wollinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"Paar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-58691-1_39","volume-title":"Algorithmic Number Theory","author":"L.M. Adlemann","year":"1994","unstructured":"Adlemann, L.M., DeMarrais, J., Huang, M.-D.: A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 28\u201340. Springer, Heidelberg (1994)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Analogical and Inductive Inference","author":"I.F. Blake","year":"1987","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. In: Jantke, K.P. (ed.) AII 1986. LNCS, vol.\u00a0265, Springer, Heidelberg (1987)"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/332833.332839","volume":"43","author":"G. Borriello","year":"2000","unstructured":"Borriello, G., Want, R.: Embedded computation meets the world wide web. Communications of the ACM\u00a043(5), 59\u201366 (2000)","journal-title":"Communications of the ACM"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-36400-5_29","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"N. Boston","year":"2003","unstructured":"Boston, N., Clancy, T., Liow, Y., Webster, J.: Genus Two Hyperelliptic Curve Coprocessor. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 400\u2013414. Springer, Heidelberg (2003)"},{"issue":"177","key":"1_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"D.G. Cantor","year":"1987","unstructured":"Cantor, D.G.: Computing in Jacobian of a Hyperelliptic Curve. Mathematics of Computation\u00a048(177), 95\u2013101 (1987)","journal-title":"Mathematics of Computation"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0IT-22, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR7","unstructured":"Enge, A.: Computing discrete logarithms in high-genus hyperelliptic jacobians in provably subexponential time (1999) (preprint), Available at \n                    \n                      http:\/\/www.math.waterloo.ca\/Cond0_Dept\/CORR\/corr99.html"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4064\/aa102-1-6","volume":"102","author":"A. Enge","year":"2002","unstructured":"Enge, A., Gaudry, P.: A general framework for subexponential discrete logarithm algorithms. Acta Arith.\u00a0102, 83\u2013103 (2002)","journal-title":"Acta Arith."},{"issue":"5","key":"1_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/332833.332836","volume":"43","author":"D. Estrin","year":"2000","unstructured":"Estrin, D., Govindan, R., Heidemann, J.: Embedding the Internet. Communications of the ACM\u00a043(5), 39\u201341 (2000)","journal-title":"Communications of the ACM"},{"key":"1_CR10","unstructured":"Flassenberg, R., Paulus, S.: Sieving in function fields (1997), To appear in Experimental Mathematics, Available at \n                    \n                      ftp:\/\/ftp.informatik.tu-darmstadt.de\/pub\/TI\/TR\/TI-97-13.rafla.ps.gz\n                    \n                    \n                  ;"},{"issue":"206","key":"1_CR11","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation\u00a062(206), 865\u2013874 (1994)","journal-title":"Mathematics of Computation"},{"key":"1_CR12","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\u2013517. Springer, Heidelberg (2001)"},{"issue":"232","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1090\/S0025-5718-99-01119-9","volume":"69","author":"R. Gallant","year":"2000","unstructured":"Gallant, R., Lambert, R., Vanstone, S.: Improving the parallelized Pollard lambda search on anomalous binary curves. Mathematics of Computation\u00a069(232), 1699\u20131705 (2000)","journal-title":"Mathematics of Computation"},{"key":"1_CR14","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":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/10722028_18","volume-title":"Algorithmic Number Theory","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P., Harley, R.: Counting Points on Hyperelliptic Curves over Finite Fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 297\u2013312. Springer, Heidelberg (2000)"},{"key":"1_CR16","unstructured":"Harley, R.: Fast Arithmetic on Genus Two Curves (2000), Available at \n                    \n                      http:\/\/cristal.inria.fr\/~harley\/hyper\/"},{"key":"1_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":"1_CR18","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":"1_CR19","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: Hyperelliptic Cryptosystems. Brickell, E.F. (ed.) Journal of Cryptology, 139\u2013150 (1989)","DOI":"10.1007\/BF02252872"},{"key":"1_CR20","series-title":"Algorithms and Computation in Mathematics","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. Algorithms and Computation in Mathematics. Springer, Heidelberg (1998)"},{"key":"1_CR21","unstructured":"Krieger, U.: signature.c. Master\u2019s thesis, Universit\u00e4t Essen, Fachbereich 6 (Mathematik und Informatik) (February 1997) (Diplomarbeit)"},{"key":"1_CR22","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, SCIS 2002, Japan, January 29-February 1 (2002)"},{"key":"1_CR23","unstructured":"Lange, T.: Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. Cryptology ePrint Archive, Report 2002\/121 (2002), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"1_CR24","unstructured":"Lange, T.: Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002\/147 (2002), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"1_CR25","unstructured":"Lange, T.: Weighted Coordinates on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002\/153 (2002), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-46588-1_30","volume-title":"Public Key Cryptography","author":"A. Lenstra","year":"2000","unstructured":"Lenstra, A., Verheul, E.: Selecting Cryptographic Key Sizes. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 446\u2013465. Springer, Heidelberg (2000)"},{"key":"1_CR27","unstructured":"Matsuo, K., Chao, J., Tsujii, S.: Fast Genus Two Hyperelliptic Curve Cryptosystems. In: ISEC 2001-31, IEICE (2001)"},{"key":"1_CR28","volume-title":"Algebraic Aspects of Cryptography","author":"J. Menezes","year":"1996","unstructured":"Menezes, J., Wu, Y.-H., Zuccherato, R.: An elementary introduction to hyperelliptic curves. In: Koblitz, N. (ed.) Algebraic Aspects of Cryptography, Springer, Heidelberg (1996)"},{"key":"1_CR29","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. Miller","year":"1986","unstructured":"Miller, V.: Uses of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"1_CR30","unstructured":"Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., Tsuji, S.: A Fast Addition Algorithm of Genus Two Hyperelliptic Curves. In: SCIS, IEICE Japan, pp. 497\u2013502 (2002) (in Japanese)"},{"key":"1_CR31","volume-title":"Prog. Math.","author":"D. Mumford","year":"1984","unstructured":"Mumford, D.: Tata lectures on theta II. In: Prog. Math., vol.\u00a043, Birkh\u00e4user, Basel (1984)"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/10722028_28","volume-title":"Algorithmic Number Theory","author":"K. Nagao","year":"2000","unstructured":"Nagao, K.: Improving group law algorithms for Jacobians of hyperelliptic curves. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 439\u2013448. Springer, Heidelberg (2000)"},{"key":"1_CR33","unstructured":"Pelzl, J.: Hyperelliptic Cryptosystems on Embedded Microprocessors. Master\u2019s thesis, Fakult\u00e4t f\u00fcr Elektrotechnik und Informationstechnik, Ruhr-Universit\u00e4t Bochum (September 2002) (Diplomarbeit)"},{"key":"1_CR34","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)"},{"issue":"143","key":"1_CR35","first-page":"918","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation mod p. Mathematics of Computation\u00a032(143), 918\u2013924 (1978)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"1_CR36","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(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"issue":"226","key":"1_CR37","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1090\/S0025-5718-99-01043-1","volume":"68","author":"H.-G. R\u00fcck","year":"1999","unstructured":"R\u00fcck, H.-G.: On the discrete logarithm in the divisor class group of curves. Mathematics of Computation\u00a068(226), 805\u2013806 (1999)","journal-title":"Mathematics of Computation"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-49649-1_8","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"Y. Sakai","year":"1998","unstructured":"Sakai, Y., Sakurai, K.: Design of Hyperelliptic Cryptosystems in small Characteristic and a Software Implementation over \n                    \n                      \n                    \n                    $\\mathbb{F}_{2^n}$\n                  . In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 80\u201394. Springer, Heidelberg (1998)"},{"issue":"4","key":"1_CR39","first-page":"692","volume":"E83-A","author":"Y. Sakai","year":"2000","unstructured":"Sakai, Y., Sakurai, K.: On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E83-A(4), 692\u2013703 (2000)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"17","key":"1_CR40","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1155\/S1073792802111160","volume":"2002","author":"J. Scholten","year":"2002","unstructured":"Scholten, J., Zhu, J.: Hyperelliptic curves in characteristic 2. International Mathematics Research Notices\u00a02002(17), 905\u2013917 (2002)","journal-title":"International Mathematics Research Notices"},{"key":"1_CR41","unstructured":"Shoup, V.: NTL: A libary for doing Number Theory, version 5.0c (2001), \n                    \n                      http:\/\/www.shoup.net\/ntl\/index.html"},{"key":"1_CR42","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":"1_CR43","unstructured":"Takahashi, M.: Improving Harley Algorithms for Jacobians of Genus 2 Hyperelliptic Curves. In: SCIS, IEICE Japan (2002) ( in Japanese)"},{"key":"1_CR44","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)"},{"issue":"1","key":"1_CR45","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"IT-32","author":"D.H. Wiedemann","year":"1986","unstructured":"Wiedemann, D.H.: Solving Sparse Linear Equations Over Finite Fields. IEEE Transactions on Information Theory\u00a0IT-32(1), 54\u201362 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR46","unstructured":"Wollinger, T.: Computer Architectures for Cryptosystems Based on Hyperelliptic Curves. Master\u2019s thesis, ECE Department, Worcester Polytechnic Institute, Worcester, Massachusetts, USA (May 2001)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24654-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T02:58:20Z","timestamp":1620010700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24654-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213703","9783540246541"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24654-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}