{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T05:55:17Z","timestamp":1779342917032,"version":"3.51.4"},"reference-count":72,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2004,8,1]],"date-time":"2004-08-01T00:00:00Z","timestamp":1091318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2004,8]]},"abstract":"<jats:p>It is widely recognized that data security will play a central role in future IT systems. Providing public-key cryptographic primitives, which are the core tools for security, is often difficult on embedded processor due to computational, memory, and power constraints. This contribution appears to be the first thorough comparison of two public-key families, namely elliptic curve (ECC) and hyperelliptic curve cryptosystems on a wide range of embedded processor types (ARM, ColdFire, PowerPC). We investigated the influence of the processor type, resources, and architecture regarding throughput. Further, we improved previously known HECC algorithms resulting in a more efficient arithmetic.<\/jats:p>","DOI":"10.1145\/1015047.1015051","type":"journal-article","created":{"date-parts":[[2005,8,2]],"date-time":"2005-08-02T08:38:10Z","timestamp":1122971890000},"page":"509-533","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Elliptic and hyperelliptic curves on embedded \u03bcP"],"prefix":"10.1145","volume":"3","author":[{"given":"Thomas","family":"Wollinger","sequence":"first","affiliation":[{"name":"University of Bochum, Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Pelzl","sequence":"additional","affiliation":[{"name":"University of Bochum, Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Wittelsberger","sequence":"additional","affiliation":[{"name":"University of Bochum, Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"Paar","sequence":"additional","affiliation":[{"name":"University of Bochum, Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00f6kay","family":"Saldamli","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, Oregon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c7etin K.","family":"Ko\u00e7","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, Oregon"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.223883"},{"key":"e_1_2_1_2_1","unstructured":"ANSI X9.62-1999. 1999. The Elliptic Curve Digital Signature Algorithm. Tech. rep. ANSI.]]  ANSI X9.62-1999. 1999. The Elliptic Curve Digital Signature Algorithm. Tech. rep. ANSI.]]"},{"key":"e_1_2_1_3_1","unstructured":"ANSI X9.63-199x. 1998. Elliptic Curve Key Agreement and Key Transport Protocols. Draft ANSI. Working document.]]  ANSI X9.63-199x. 1998. Elliptic Curve Key Agreement and Key Transport Protocols. Draft ANSI. Working document.]]"},{"key":"e_1_2_1_4_1","unstructured":"ARM. 2000. ARM Evaluator-7T Board User Guide. Available at http:\/\/www.arm.com\/support\/.]]  ARM. 2000. ARM Evaluator-7T Board User Guide. Available at http:\/\/www.arm.com\/support\/.]]"},{"key":"e_1_2_1_5_1","volume-title":"Information Theory and Applications","author":"Blake","unstructured":"Blake , Gao, and Lambert . 1993. Constructive problems for irreducible polynomials over finite fields . In Information Theory and Applications . Springer-Verlag , Berlin , 1--23.]] Blake, Gao, and Lambert. 1993. Constructive problems for irreducible polynomials over finite fields. In Information Theory and Applications. Springer-Verlag, Berlin, 1--23.]]"},{"key":"e_1_2_1_6_1","volume-title":"Elliptic Curves in Cryptography. London Mathematical Society Lecture Notes Series","volume":"265","author":"Blake I.","unstructured":"Blake , I. , Seroussi , G. , and Smart , N . 1999 . Elliptic Curves in Cryptography. London Mathematical Society Lecture Notes Series , vol. 265 . Cambridge University Press, Cambridge, UK.]] Blake, I., Seroussi, G., and Smart, N. 1999. Elliptic Curves in Cryptography. London Mathematical Society Lecture Notes Series, vol. 265. Cambridge University Press, Cambridge, UK.]]"},{"key":"e_1_2_1_7_1","volume-title":"Lecture Notes in Computer Science","volume":"2523","author":"Boston N.","unstructured":"Boston , N. , Clancy , T. , Liow , Y. , and Webster , J . 2002. Genus two hyperelliptic curve coprocessor. In Cryptographic Hardware and Embedded Systems---CHES 2002, J. K. K. B. S. Kaliski and C. Paar, eds . Lecture Notes in Computer Science , vol. 2523 . Springer-Verlag, Berlin, 529--539.]] Boston, N., Clancy, T., Liow, Y., and Webster, J. 2002. Genus two hyperelliptic curve coprocessor. In Cryptographic Hardware and Embedded Systems---CHES 2002, J. c. K. K. B. S. Kaliski and C. Paar, eds. Lecture Notes in Computer Science, vol. 2523. Springer-Verlag, Berlin, 529--539.]]"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Cantor D. 1987. Computing in Jacobian of a hyperelliptic curve. Math. Comput. 48 177 95--101.]]  Cantor D. 1987. Computing in Jacobian of a hyperelliptic curve. Math. Comput. 48 177 95--101.]]","DOI":"10.1090\/S0025-5718-1987-0866101-0"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(86)90023-0"},{"key":"e_1_2_1_10_1","volume-title":"A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics","author":"Cohen H.","year":"1996","unstructured":"Cohen , H. 1993. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics , vol. 138 . Springer-Verlag , Berlin, Germany (Third corrected printing 1996 ).]] Cohen, H. 1993. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol. 138. Springer-Verlag, Berlin, Germany (Third corrected printing 1996).]]"},{"key":"e_1_2_1_11_1","volume-title":"Lecture Notes in Computer Science","volume":"1514","author":"Cohen H.","unstructured":"Cohen , H. , Miyaji , A. , and Ono , T . 1998. Efficient elliptic curve exponentiation using mixed coordinates. In Advances in Cryptology---ASIACRYPT'98, K. Ohta and D. Pei, eds . Lecture Notes in Computer Science , vol. 1514 . Springer-Verlag, Berlin, 51--65.]] Cohen, H., Miyaji, A., and Ono, T. 1998. Efficient elliptic curve exponentiation using mixed coordinates. In Advances in Cryptology---ASIACRYPT'98, K. Ohta and D. Pei, eds. Lecture Notes in Computer Science, vol. 1514. Springer-Verlag, Berlin, 51--65.]]"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Dierks T. and Allen C. 1999. RFC 2246: The TLS Protocol Version 1.0. Corporation for National Research Initiatives Internet Engineering Task Force Network Working Group Reston Virginia USA.]]   Dierks T. and Allen C. 1999. RFC 2246: The TLS Protocol Version 1.0. Corporation for National Research Initiatives Internet Engineering Task Force Network Working Group Reston Virginia USA.]]","DOI":"10.17487\/rfc2246"},{"key":"e_1_2_1_13_1","unstructured":"Freier A. O. Karlton P. and Kocher P. C. 1996. The SSL Protocol Version 3.0. Transport Layer Security Working Group Internet-Draft.]]  Freier A. O. Karlton P. and Kocher P. C. 1996. The SSL Protocol Version 3.0. Transport Layer Security Working Group Internet-Draft.]]"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2153546"},{"key":"e_1_2_1_15_1","volume-title":"Algebraic Curves---An Introduction to Algebraic Geometry. W. A. Benjamin","author":"Fulton W.","unstructured":"Fulton , W. 1969. Algebraic Curves---An Introduction to Algebraic Geometry. W. A. Benjamin , Inc., Reading, M. ]] Fulton, W. 1969. Algebraic Curves---An Introduction to Algebraic Geometry. W. A. Benjamin, Inc., Reading, M.]]"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/647097.717012"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Gallant R. Lambert R. and Vanstone S. 1998. Improving the parallelized Pollard lambda search on binary anomalous curves. Available at http:\/\/www.certicom.com\/chal\/download\/paper.ps.]]  Gallant R. Lambert R. and Vanstone S. 1998. Improving the parallelized Pollard lambda search on binary anomalous curves. Available at http:\/\/www.certicom.com\/chal\/download\/paper.ps.]]","DOI":"10.1090\/S0025-5718-99-01119-9"},{"key":"e_1_2_1_18_1","volume-title":"Workshop on Cryptographic Hardware and Embedded Systems---CHES 19999","volume":"1717","author":"Gao L.","unstructured":"Gao , L. , Shrivastava , S. , and Sobelman , G . 1999. Elliptic curve scalar multiplier design using FPGAs . In Workshop on Cryptographic Hardware and Embedded Systems---CHES 19999 , \u00c7. Ko\u00e7 and C. Paar, eds. Lecture Notes in Computer Science , vol. 1717 . Springer-Verlag, Berlin.]] Gao, L., Shrivastava, S., and Sobelman, G. 1999. Elliptic curve scalar multiplier design using FPGAs. In Workshop on Cryptographic Hardware and Embedded Systems---CHES 19999, \u00c7. Ko\u00e7 and C. Paar, eds. Lecture Notes in Computer Science, vol. 1717. Springer-Verlag, Berlin.]]"},{"key":"e_1_2_1_19_1","volume-title":"Advances in Cryptology---EUROCRYPT","author":"Gaudry P.","year":"2000","unstructured":"Gaudry , P. 2000. An algorithm for solving the discrete log problem on hyperelliptic curves . In Advances in Cryptology---EUROCRYPT 2000 , B. Preneel, ed. Lecture Notes in Computer Science, vol. 1807 . Springer-Verlag , Berlin, Germany, 19--34.]] Gaudry, P. 2000. An algorithm for solving the discrete log problem on hyperelliptic curves. In Advances in Cryptology---EUROCRYPT 2000, B. Preneel, ed. Lecture Notes in Computer Science, vol. 1807. Springer-Verlag, Berlin, Germany, 19--34.]]"},{"key":"e_1_2_1_20_1","volume-title":"Lecture Notes in Computer Science","volume":"1838","author":"Gaudry P.","unstructured":"Gaudry , P. and Harley , R . 2000. Counting points on hyperelliptic curves over finite fields. In ANTS IV, W. Bosma, ed . Lecture Notes in Computer Science , vol. 1838 . Springer Verlag, Berlin, 297--312.]] Gaudry, P. and Harley, R. 2000. Counting points on hyperelliptic curves over finite fields. In ANTS IV, W. Bosma, ed. Lecture Notes in Computer Science, vol. 1838. Springer Verlag, Berlin, 297--312.]]"},{"key":"e_1_2_1_21_1","volume-title":"Constructive and Destructive Facets of Weil Descent on Elliptic Curves. Tech. Rep. HPL 2000-10","author":"Gaudry P.","year":"2000","unstructured":"Gaudry , P. , Hess , F. , and Smart , N. P . 2000 . Constructive and Destructive Facets of Weil Descent on Elliptic Curves. Tech. Rep. HPL 2000-10 , HP Labs. Available at http:\/\/www.hpl.hp.com\/ techreports\/ 2000 \/HPL-2000-10.html.]] Gaudry, P., Hess, F., and Smart, N. P. 2000. Constructive and Destructive Facets of Weil Descent on Elliptic Curves. Tech. Rep. HPL 2000-10, HP Labs. Available at http:\/\/www.hpl.hp.com\/ techreports\/2000\/HPL-2000-10.html.]]"},{"key":"e_1_2_1_22_1","volume-title":"Seventh Annual Workshop on Selected Areas in Cryptography---SAC","volume":"2012","author":"G\u00fcnter C.","year":"2000","unstructured":"G\u00fcnter , C. , Lange , T. , and Stein , A . 2000. Speeding up the arithmetic on koblitz curves of genus two . In Seventh Annual Workshop on Selected Areas in Cryptography---SAC 2000 . Lecture Notes in Computer Science , vol. 2012 . Springer-Verlag, Berlin, Germany, 106--117.]] G\u00fcnter, C., Lange, T., and Stein, A. 2000. Speeding up the arithmetic on koblitz curves of genus two. In Seventh Annual Workshop on Selected Areas in Cryptography---SAC 2000. Lecture Notes in Computer Science, vol. 2012. Springer-Verlag, Berlin, Germany, 106--117.]]"},{"key":"e_1_2_1_23_1","volume-title":"Shift Register Sequences. Holden-Day","author":"Golomb S.","unstructured":"Golomb , S. 1967. Shift Register Sequences. Holden-Day , San Francisco , California, USA. ]] Golomb, S. 1967. Shift Register Sequences. Holden-Day, San Francisco, California, USA.]]"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0913"},{"key":"e_1_2_1_25_1","volume-title":"Advances in Cryptology---CRYPTO '97","volume":"1294","author":"Guajardo J.","unstructured":"Guajardo , J. and Paar , C . 1997. Efficient algorithms for elliptic curve cryptosystems . In Advances in Cryptology---CRYPTO '97 , B. Kaliski, ed. Lecture Notes in Computer Science , vol. 1294 . Springer-Verlag, Berlin, Germany, 342--356.]] Guajardo, J. and Paar, C. 1997. Efficient algorithms for elliptic curve cryptosystems. In Advances in Cryptology---CRYPTO '97, B. Kaliski, ed. Lecture Notes in Computer Science, vol. 1294. Springer-Verlag, Berlin, Germany, 342--356.]]"},{"key":"e_1_2_1_26_1","volume-title":"Lecture Notes in Computer Science","volume":"1965","author":"Gura N.","unstructured":"Gura , N. , Chang , S. , Eberle , H. , Sumit , G. , Gupta , V. , Finchelstein , D. , Goupy , E. , and Stebila , D . 2001. An end-to-end systems approach to elliptic curve cryptography. In Cryptographic Hardware and Embedded Systems---CHES 2001 . Lecture Notes in Computer Science , vol. 1965 . Springer-Verlag, Berlin, 351--366.]] Gura, N., Chang, S., Eberle, H., Sumit, G., Gupta, V., Finchelstein, D., Goupy, E., and Stebila, D. 2001. An end-to-end systems approach to elliptic curve cryptography. In Cryptographic Hardware and Embedded Systems---CHES 2001. Lecture Notes in Computer Science, vol. 1965. Springer-Verlag, Berlin, 351--366.]]"},{"key":"e_1_2_1_27_1","volume-title":"Second International Workshop on Cryptographic Hardware and Embedded Systems---CHES","author":"Hankerson D.","year":"2000","unstructured":"Hankerson , D. , Hernandez , J. L. , and Menezes , A . 2000. Software implementation of elliptic curve cryptography over binary fields . In Second International Workshop on Cryptographic Hardware and Embedded Systems---CHES 2000 , \u00c7. Ko\u00e7 and C. Paar, eds. Lecture Notes in Computer Science , vol. Springer-Verlag, Berlin.]] Hankerson, D., Hernandez, J. L., and Menezes, A. 2000. Software implementation of elliptic curve cryptography over binary fields. In Second International Workshop on Cryptographic Hardware and Embedded Systems---CHES 2000, \u00c7. Ko\u00e7 and C. Paar, eds. Lecture Notes in Computer Science, vol. Springer-Verlag, Berlin.]]"},{"key":"e_1_2_1_28_1","unstructured":"Harley R. 2000. Fast Arithmetic on Genus Two Curves. Available at http:\/\/cristal.inria.fr\/harley\/hyper\/. adding.txt and doubling.c.]]  Harley R. 2000. Fast Arithmetic on Genus Two Curves. Available at http:\/\/cristal.inria.fr\/harley\/hyper\/. adding.txt and doubling.c.]]"},{"key":"e_1_2_1_29_1","volume-title":"IEEE P1363 Standard Specifications for Public Key Cryptography","unstructured":"IEEE 1999. IEEE P1363 Standard Specifications for Public Key Cryptography . IEEE. Last Preliminary Draft .]] IEEE 1999. IEEE P1363 Standard Specifications for Public Key Cryptography. IEEE. Last Preliminary Draft.]]"},{"key":"e_1_2_1_30_1","first-page":"595","article-title":"Multiplication of multidigit numbers on automata","volume":"7","author":"Karatsuba A.","year":"1963","unstructured":"Karatsuba , A. and Ofman , Y. 1963 . Multiplication of multidigit numbers on automata . Sov. Phys. Dokl. (English translation) 7 , 7, 595 -- 596 .]] Karatsuba, A. and Ofman, Y. 1963. Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. (English translation) 7, 7, 595--596.]]","journal-title":"Sov. Phys. Dokl. (English translation)"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Kent S. and Atkinson R. 1998. RFC 2401: Security Architecture for the Internet Protocol. Corporation for National Research Initiatives Internet Engineering Task Force Network Working Group Reston Virginia USA.]]   Kent S. and Atkinson R. 1998. RFC 2401: Security Architecture for the Internet Protocol. Corporation for National Research Initiatives Internet Engineering Task Force Network Working Group Reston Virginia USA.]]","DOI":"10.17487\/rfc2401"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646557.694754"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"e_1_2_1_34_1","volume-title":"Advances in Cryptology---Crypto '88","volume":"403","author":"Koblitz N.","year":"1988","unstructured":"Koblitz , N. 1988 . A family of jacobians suitable for discrete log cryptosystems . In Advances in Cryptology---Crypto '88 , S. Goldwasser, ed. Lecture Notes in Computer Science , vol. 403 . Springer-Verlag, Berlin, 94--99.]] Koblitz, N. 1988. A family of jacobians suitable for discrete log cryptosystems. In Advances in Cryptology---Crypto '88, S. Goldwasser, ed. Lecture Notes in Computer Science, vol. 403. Springer-Verlag, Berlin, 94--99.]]"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252872"},{"key":"e_1_2_1_36_1","volume-title":"Advances in Cryptology---CRYPTO '91","volume":"576","author":"Koblitz N.","year":"1991","unstructured":"Koblitz , N. 1991 . Cm---curves with good cryptographic properties . In Advances in Cryptology---CRYPTO '91 , J. Feigenbaum, ed. Lecture Notes in Computer Science , vol. 576 . Springer-Verlag, Berlin, Germany, 279--287.]] Koblitz, N. 1991. Cm---curves with good cryptographic properties. In Advances in Cryptology---CRYPTO '91, J. Feigenbaum, ed. Lecture Notes in Computer Science, vol. 576. Springer-Verlag, Berlin, Germany, 279--287.]]"},{"key":"e_1_2_1_37_1","volume-title":"Algebraic Aspects of Cryptography","author":"Koblitz N.","unstructured":"Koblitz , N. 1998. Algebraic Aspects of Cryptography , 2 nd ed. Springer-Verlag , Berlin, Germany .]] Koblitz, N. 1998. Algebraic Aspects of Cryptography, 2nd ed. Springer-Verlag, Berlin, Germany.]]","edition":"2"},{"key":"e_1_2_1_39_1","volume-title":"The 2002 Symposium on Cryptography and Information Security, Japan---SCIS","author":"Kuroki J.","year":"2002","unstructured":"Kuroki , J. , Gonda , M. , Matsuo , K. , Chao , J. , and Tsujii , S . 2002. Fast genus three hyperelliptic curve cryptosystems . In The 2002 Symposium on Cryptography and Information Security, Japan---SCIS 2002 .]] Kuroki, J., Gonda, M., Matsuo, K., Chao, J., and Tsujii, S. 2002. Fast genus three hyperelliptic curve cryptosystems. In The 2002 Symposium on Cryptography and Information Security, Japan---SCIS 2002.]]"},{"key":"e_1_2_1_43_1","volume-title":"Third International Workshop on Practice and Theory in Public Key Cryptography---PKC","volume":"1751","author":"Lenstra A.","year":"2000","unstructured":"Lenstra , A. and Verheul , E . 2000. Selecting cryptographic key sizes . In Third International Workshop on Practice and Theory in Public Key Cryptography---PKC 2000 , H. Imai and Y. Zheng, eds. Lecture Notes in Computer Science , vol. 1751 . Springer-Verlag, Berlin.]] Lenstra, A. and Verheul, E. 2000. Selecting cryptographic key sizes. In Third International Workshop on Practice and Theory in Public Key Cryptography---PKC 2000, H. Imai and Y. Zheng, eds. Lecture Notes in Computer Science, vol. 1751. Springer-Verlag, Berlin.]]"},{"key":"e_1_2_1_44_1","volume-title":"Lecture Notes in Computer Science","volume":"1717","author":"L\u00f3pez J.","unstructured":"L\u00f3pez , J. and Dahab , R . 1999. Fast multiplication on elliptic curves over GF(2n). In Cryptographic Hardware and Embedded Systems---CHES 1999, J. \u00c7. K. Ko\u00e7 and C. Paar, eds . Lecture Notes in Computer Science , vol. 1717 . Springer-Verlag, 316--327.]] L\u00f3pez, J. and Dahab, R. 1999. Fast multiplication on elliptic curves over GF(2n). In Cryptographic Hardware and Embedded Systems---CHES 1999, J. \u00c7. K. Ko\u00e7 and C. Paar, eds. Lecture Notes in Computer Science, vol. 1717. Springer-Verlag, 316--327.]]"},{"key":"e_1_2_1_45_1","volume-title":"Fast Genus Two Hyperelliptic Curve Cryptosystems. In ISEC2001-31","author":"Matsuo K.","unstructured":"Matsuo , K. , Chao , J. , and Tsujii , S . 2001 . Fast Genus Two Hyperelliptic Curve Cryptosystems. In ISEC2001-31 . IEICE.]] Matsuo, K., Chao, J., and Tsujii, S. 2001. Fast Genus Two Hyperelliptic Curve Cryptosystems. In ISEC2001-31. IEICE.]]"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.259647"},{"key":"e_1_2_1_47_1","unstructured":"Menezes A. J. van Oorschot P. C. and Vanstone S. A. 1997. Handbook of Applied Cryptography. CRC Press Boca Raton Florida USA.]]   Menezes A. J. van Oorschot P. C. and Vanstone S. A. 1997. Handbook of Applied Cryptography. CRC Press Boca Raton Florida USA.]]"},{"key":"e_1_2_1_48_1","unstructured":"Menezes A. J. Wu Y. H. and Zuccherato R. J. 1996. An Elementary Introduction to Hyperelliptic Curves. Personal correspondence.]]  Menezes A. J. Wu Y. H. and Zuccherato R. J. 1996. An Elementary Introduction to Hyperelliptic Curves. Personal correspondence.]]"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/18262.25413"},{"key":"e_1_2_1_50_1","volume-title":"The 2002 Symposium on Cryptography and Information Security---SCIS","author":"Miyamoto Y.","year":"2002","unstructured":"Miyamoto , Y. , Doi , H. , Matsuo , K. , Chao , J. , and Tsuji , S . 2002. A fast addition algorithm of genus two hyperelliptic curve . In The 2002 Symposium on Cryptography and Information Security---SCIS 2002 . IEICE, Japan, 497--50. (in Japanese).]] Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., and Tsuji, S. 2002. A fast addition algorithm of genus two hyperelliptic curve. In The 2002 Symposium on Cryptography and Information Security---SCIS 2002. IEICE, Japan, 497--50. (in Japanese).]]"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866113-7"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1990240605311"},{"key":"e_1_2_1_53_1","unstructured":"Motorola. 2000a. MFC5307 User's Manual. http:\/\/e-www.motorola.com\/collateral\/MCF5307-BUM.pdf.]]  Motorola. 2000a. MFC5307 User's Manual. http:\/\/e-www.motorola.com\/collateral\/MCF5307-BUM.pdf.]]"},{"key":"e_1_2_1_54_1","unstructured":"Motorola. 2000b. MPC823 User's Manual. http:\/\/e-www.motorola.com\/brdata\/PDFDB\/docs\/ MPC823UM.pdf.]]  Motorola. 2000b. MPC823 User's Manual. http:\/\/e-www.motorola.com\/brdata\/PDFDB\/docs\/ MPC823UM.pdf.]]"},{"key":"e_1_2_1_55_1","volume-title":"Progress in Mathematics","author":"Mumford D.","unstructured":"Mumford , D. 1984. Tata lectures on theta II . In Progress in Mathematics , vol. 43 . Birkh\u00e4user .]] Mumford, D. 1984. Tata lectures on theta II. In Progress in Mathematics, vol. 43. Birkh\u00e4user.]]"},{"key":"e_1_2_1_56_1","series-title":"Lecture Notes in Computer Science","volume-title":"Improving group law algorithms for Jacobians of hyperelliptic curves","author":"Nagao K.","unstructured":"Nagao , K. 2000. Improving group law algorithms for Jacobians of hyperelliptic curves . In ANTS IV, W. Bosma, ed. Lecture Notes in Computer Science , vol. 1838 . Springer Verlag , Berlin , 439--448.]] Nagao, K. 2000. Improving group law algorithms for Jacobians of hyperelliptic curves. In ANTS IV, W. Bosma, ed. Lecture Notes in Computer Science, vol. 1838. Springer Verlag, Berlin, 439--448.]]"},{"key":"e_1_2_1_57_1","volume-title":"Lecture Notes in Computer Science","volume":"1965","author":"Orlando G.","unstructured":"Orlando , G. and Paar , C . 2000. A high-performance reconfigurable elliptic curve processor for GF(2m). In Cryptographic Hardware and Embedded Systems---CHES 2000, \u00c7. K. Ko\u00e7 and C. Paar, eds . Lecture Notes in Computer Science , vol. 1965 . Springer-Verlag.]] Orlando, G. and Paar, C. 2000. A high-performance reconfigurable elliptic curve processor for GF(2m). In Cryptographic Hardware and Embedded Systems---CHES 2000, \u00c7. K. Ko\u00e7 and C. Paar, eds. Lecture Notes in Computer Science, vol. 1965. Springer-Verlag.]]"},{"key":"e_1_2_1_59_1","volume-title":"Tenth Annual Workshop on Selected Areas in Cryptography---SAC","author":"Pelzl J.","year":"2003","unstructured":"Pelzl , J. , Wollinger , T. , and Paar , C . 2003. Low cost security: Explicit formulae for genus-4 hyperelliptic curves . In Tenth Annual Workshop on Selected Areas in Cryptography---SAC 2003 . Springer-Verlag, Berlin, Germany.]] Pelzl, J., Wollinger, T., and Paar, C. 2003. Low cost security: Explicit formulae for genus-4 hyperelliptic curves. In Tenth Annual Workshop on Selected Areas in Cryptography---SAC 2003. Springer-Verlag, Berlin, Germany.]]"},{"key":"e_1_2_1_60_1","first-page":"143","article-title":"Monte Carlo methods for index computation mod p","volume":"32","author":"Pollard J. M.","year":"1978","unstructured":"Pollard , J. M. 1978 . Monte Carlo methods for index computation mod p . Math. Comput. 32 , 143 (July), 918--924.]] Pollard, J. M. 1978. Monte Carlo methods for index computation mod p. Math. Comput. 32, 143 (July), 918--924.]]","journal-title":"Math. Comput."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01043-1"},{"key":"e_1_2_1_64_1","unstructured":"Sakai Y. and Sakurai K. 2000. On the practical performance of hyperelliptic curve cryptosystems in software implementation. In IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences vol. E83-A NO.4. 692--703. IEICE Trans.]]  Sakai Y. and Sakurai K. 2000. On the practical performance of hyperelliptic curve cryptosystems in software implementation. In IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences vol. E83-A NO.4. 692--703. IEICE Trans.]]"},{"key":"e_1_2_1_65_1","volume-title":"Public Key Cryptography. Lecture Notes in Computer Science","volume":"1431","author":"Sakai Y.","unstructured":"Sakai , Y. , Sakurai , K. , and Ishizuka , H . 1998. Secure hyperelliptic cryptosystems and their performance . In Public Key Cryptography. Lecture Notes in Computer Science , vol. 1431 . Springer-Verlag, Berlin, 164--181.]] Sakai, Y., Sakurai, K., and Ishizuka, H. 1998. Secure hyperelliptic cryptosystems and their performance. In Public Key Cryptography. Lecture Notes in Computer Science, vol. 1431. Springer-Verlag, Berlin, 164--181.]]"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1155\/S1073792802111160"},{"key":"e_1_2_1_67_1","volume-title":"Advances in Cryptology---CRYPTO '95","author":"Schroeppel R.","unstructured":"Schroeppel , R. , Orman , H. , O'Malley , S. , and Spatscheck , O . 1995. Fast key exchange with elliptic curve systems . In Advances in Cryptology---CRYPTO '95 , D. Coppersmith, ed. 963. Springer-Verlag, Berlin, Germany, 43--56.]] Schroeppel, R., Orman, H., O'Malley, S., and Spatscheck, O. 1995. Fast key exchange with elliptic curve systems. In Advances in Cryptology---CRYPTO '95, D. Coppersmith, ed. 963. Springer-Verlag, Berlin, Germany, 43--56.]]"},{"key":"e_1_2_1_68_1","volume-title":"The Arithmetic of Elliptic Curves","author":"Silverman J. H.","unstructured":"Silverman , J. H. 1986. The Arithmetic of Elliptic Curves . Springer-Verlag , New York .]] Silverman, J. H. 1986. The Arithmetic of Elliptic Curves. Springer-Verlag, New York.]]"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756141"},{"key":"e_1_2_1_70_1","volume-title":"Advances in Cryptology---CRYPTO '97","author":"Solinas J.","unstructured":"Solinas , J. 1997. An improved algorithm for arithmetic on a family of elliptic curves . In Advances in Cryptology---CRYPTO '97 , B. Kaliski, ed. 1294. Springer-Verlag , Berlin, Germany , 357--371.]] Solinas, J. 1997. An improved algorithm for arithmetic on a family of elliptic curves. In Advances in Cryptology---CRYPTO '97, B. Kaliski, ed. 1294. Springer-Verlag, Berlin, Germany, 357--371.]]"},{"key":"e_1_2_1_71_1","unstructured":"Takahashi M. 2002. Improving Harley algorithms for jacobians of genus 2 hyperelliptic curves. In SCIS. IEICE Japan. (in Japanese).]]  Takahashi M. 2002. Improving Harley algorithms for jacobians of genus 2 hyperelliptic curves. In SCIS. IEICE Japan. (in Japanese).]]"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/384101.384146"},{"key":"e_1_2_1_73_1","volume-title":"Lecture Notes in Computer Science","volume":"1255","author":"Von zur Gathen J.","unstructured":"Von zur Gathen , J. and N\u00f6cker , M . 2000. Exponentiation in finite fields: theory and practice. In Applied Algebra, Agebraic Algorithms and Error Correcting Codes---AAECC-12, T. Mora and H. Mattson, eds . Lecture Notes in Computer Science , vol. 1255 . Springer-Verlag, Berlin, 88--113.]] Von zur Gathen, J. and N\u00f6cker, M. 2000. Exponentiation in finite fields: theory and practice. In Applied Algebra, Agebraic Algorithms and Error Correcting Codes---AAECC-12, T. Mora and H. Mattson, eds. Lecture Notes in Computer Science, vol. 1255. Springer-Verlag, Berlin, 88--113.]]"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057137"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2002.1046458"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(70)90264-0"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(68)90973-X"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90356-8"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015047.1015051","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1015047.1015051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:32Z","timestamp":1750286612000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1015047.1015051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":72,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,8]]}},"alternative-id":["10.1145\/1015047.1015051"],"URL":"https:\/\/doi.org\/10.1145\/1015047.1015051","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8]]},"assertion":[{"value":"2004-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}