{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:56:47Z","timestamp":1768723007892,"version":"3.49.0"},"reference-count":54,"publisher":"Institution of Engineering and Technology (IET)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IET Inf. Secur."],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1049\/iet-ifs:20070003","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T22:20:35Z","timestamp":1183846835000},"page":"65-81","source":"Crossref","is-referenced-by-count":8,"title":["Efficient explicit formulae for genus 3 hyperelliptic curve cryptosystems over binary fields"],"prefix":"10.1049","volume":"1","author":[{"given":"X.","family":"Fan","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON N2L 3G1, Canada"}]},{"given":"T.","family":"Wollinger","sequence":"additional","affiliation":[{"name":"escrypt GmbH-Embedded Security, Lise-Meitner-Allee 4, Bochum, D-44801, Germany"}]},{"given":"G.","family":"Gong","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON N2L 3G1, Canada"}]}],"member":"265","reference":[{"key":"10.1049\/iet-ifs:20070003_r1","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"Diffie","year":"1976","ISSN":"https:\/\/id.crossref.org\/issn\/0018-9448","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"Rivest","year":"1978","ISSN":"https:\/\/id.crossref.org\/issn\/0001-0782","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"Koblitz","year":"1987","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r4","doi-asserted-by":"crossref","unstructured":"Miller, V.: \u2018Use of elliptic curves in cryptography, Advances in Cryptology \u2013 CRYPTO'85\u2019, Williams, H.C., Lect. Notes Comput. Sci., 218, p. 417\u2013426 1986)","DOI":"10.1007\/3-540-39799-X_31"},{"key":"10.1049\/iet-ifs:20070003_r5","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"ElGamal","year":"1985","ISSN":"https:\/\/id.crossref.org\/issn\/0018-9448","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r6","unstructured":"\u2018Digital signature standard\u2019, Federal Information Processing Standards Publication 186, US Department of Commerce\/NIST National Technical Information Service, 1994"},{"key":"10.1049\/iet-ifs:20070003_r7","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: \u2018A family of Jacobian suitable for discrete log cryptosystems\u2019, Goldwasser, S., Advances in Cryptology \u2013 CRYPTO'88\u2019, Lect. Notes Comput. Sci., 1988),403, p. 94\u201399","DOI":"10.1007\/0-387-34799-2_8"},{"key":"10.1049\/iet-ifs:20070003_r8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"Cantor","year":"1987","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"Koblitz","year":"1989","ISSN":"https:\/\/id.crossref.org\/issn\/0933-2790","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r10","doi-asserted-by":"crossref","unstructured":"Gaudry, P., and Harley, R.: \u2018Counting points on hyperelliptic curves over finite fields\u2019, Bosma, W., Algorithm Number Theory Symposium \u2013 ANTS IV\u2019, Lect. Notes Comput. Sci., 2000),1838, p. 297\u2013312","DOI":"10.1007\/10722028_18"},{"key":"10.1049\/iet-ifs:20070003_r11","unstructured":"Harley, R.: \u2018Fast arithmetic on genus two curves\u2019, 2000),http:\/\/cristal.inria.fr\/harley\/hyper\/, adding.txt and doubling.c"},{"key":"10.1049\/iet-ifs:20070003_r12","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., and Vercauteren, F.: \u2018Handbook of elliptic and hyperelliptic curve cryptography\u2019, (Chapman & Hall\/CRC, Boca Raton, FL, USA 2006)","DOI":"10.1201\/9781420034981"},{"key":"10.1049\/iet-ifs:20070003_r13","unstructured":"Wollinger, T.: \u2018Software and hardware implementation of hyperelliptic curve cryptosystems\u2019, 2004, PhD, Department of Electrical Engineering and Information Sciences, Ruhr-Universita\u0308et Bochum, Bochum, Germany"},{"key":"10.1049\/iet-ifs:20070003_r14","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/TC.2005.109","volume":"54","author":"Wollinger","year":"2005","ISSN":"https:\/\/id.crossref.org\/issn\/0018-9340","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r15","first-page":"64","volume":"3860","author":"Fan","year":"2006"},{"key":"10.1049\/iet-ifs:20070003_r16","first-page":"75","volume":"19","author":"Guyot","year":"2004"},{"key":"10.1049\/iet-ifs:20070003_r17","unstructured":"Pelzl, J.: \u2018Hyperelliptic cryptosystems on embedded microprocessor\u2019, 2002, Master's, Department of Electrical Engineering and Information Sciences, Ruhr-Universita\u0308et Bochum, Bochum, Germany"},{"key":"10.1049\/iet-ifs:20070003_r18","doi-asserted-by":"crossref","unstructured":"Pelzl, J., Wollinger, T., Guajardo, J., and Paar, C.: \u2018Hyperelliptic curve cryptosystems: Closing the performance gap to elliptic curves\u2019, Walter, C.D., Koc, C.K., Paar, C., Workshop on Cryptographic Hardware and Embedded Systems \u2013 CHES 2003\u2019, Lect. Notes Comput. Sci., 2003),2779, p. 349\u2013365","DOI":"10.1007\/978-3-540-45238-6_28"},{"key":"10.1049\/iet-ifs:20070003_r19","unstructured":"Kuroki, J., Gonda, M., Matsuo, K., Chao, J., and Tsujii, S.: \u2018Fast genus three hyperelliptic curve cryptosystems\u2019, The 2002 Symp. on Cryptography and Information Security \u2013 SCIS 2002, (IEICE, Japan 2002)"},{"key":"10.1049\/iet-ifs:20070003_r20","first-page":"509","volume":"3","author":"Wollinger","year":"2004"},{"key":"10.1049\/iet-ifs:20070003_r21","unstructured":"\u2018Efficient implementation of genus three hyperelliptic curve cryptography over GF(2n)\u2019, Cryptology ePrint Archive Report, Report 2003\/248, 2003 http:\/\/eprint.iacr.org"},{"key":"10.1049\/iet-ifs:20070003_r22","doi-asserted-by":"crossref","unstructured":"Katagi, M., Akishita, T., Kitamura, I., and Takagi, T.: \u2018Some improved algorithms for hyperelliptic curve cryptosystems using degenerate divisors\u2019, Park, C., Chee, S., Seventh Annual Int. Conf. on Information Security and Cryptology \u2013 ICISC 2004\u2019, Lect. Notes Comput. Sci., 2005),3506, p. 296\u2013312","DOI":"10.1007\/11496618_22"},{"key":"10.1049\/iet-ifs:20070003_r23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1093\/ietfec\/e89-a.1.151","volume":"E89-A","author":"Katagi","year":"2006","ISSN":"https:\/\/id.crossref.org\/issn\/0916-8508","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r24","unstructured":"\u2018Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: Interplay of field arithmetic and explicit formulae\u2019, Centre for Applied Cryptographic Research (CACR) Technical Reports, CACR, 2006\u201307 available at http:\/\/www.cacr.math.uwaterloo.ca\/"},{"key":"10.1049\/iet-ifs:20070003_r25","unstructured":"\u2018On the resultant computation in the addition Harley algorithms on hyperelliptic curves\u2019, Technical Report ISEC2006-5, IEICE, Japan, 2006, in Japanese"},{"key":"10.1049\/iet-ifs:20070003_r26","unstructured":"Gonda, M., Matsuo, K., Aoki, M., Chao, J., and Tsujii, S.: \u2018Improvements of addition algorithm on genus 3 hyperelliptic curves and their implementations\u2019, The 2004 Symp. on Cryptography and Information Security \u2013 SCIS 2004, (IEICE, Japan 2004 January)"},{"key":"10.1049\/iet-ifs:20070003_r27","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1093\/ietfec\/E88-A.1.89","volume":"E88-A","author":"Gonda","year":"2005","ISSN":"https:\/\/id.crossref.org\/issn\/0916-8508","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r28","doi-asserted-by":"crossref","unstructured":"Pelzl, J., Wollinger, T., and Paar, C.: \u2018Low cost security: explicit formulae for genus-4 hyperelliptic curves\u2019, Matsui, M., Zuccherato, R., Tenth Annual Workshop on Selected Areas in Cryptography \u2013 SAC 2003,Lect. Notes Comput. Sci.2003),3006, p. 1\u201316","DOI":"10.1007\/978-3-540-24654-1_1"},{"key":"10.1049\/iet-ifs:20070003_r29","first-page":"151","volume":"43","author":"Mumford"},{"key":"10.1049\/iet-ifs:20070003_r30","doi-asserted-by":"crossref","unstructured":"Nagao, K.: \u2018Improving group law algorithms for Jacobians of hyperelliptic curves, ANTS IV\u2019, Lect. Notes Comput. Sci., 2000),1838, p. 439\u2013448","DOI":"10.1007\/10722028_28"},{"key":"10.1049\/iet-ifs:20070003_r31","first-page":"918","volume":"32","author":"Pollard","year":"1978","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"van Oorschot","year":"1999","ISSN":"https:\/\/id.crossref.org\/issn\/0933-2790","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r33","first-page":"865","volume":"62","author":"Frey","year":"1994","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r34","doi-asserted-by":"crossref","unstructured":"Galbraith, S.: \u2018Supersingular curves in cryptography\u2019, Boyd, C., Advances in Cryptology \u2013 ASIACRYPT '01,Lect. Notes Comput. Sci.2001),2248, p. 495\u2013517","DOI":"10.1007\/3-540-45682-1_29"},{"key":"10.1049\/iet-ifs:20070003_r35","first-page":"905","volume":"17","author":"Scholten","year":"2002"},{"key":"10.1049\/iet-ifs:20070003_r36","doi-asserted-by":"crossref","unstructured":"Adlemann, L., De Marrais, J., and Huang, M.-D.: \u2018A subexponential algorithm for discrete logarithm over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields\u2019, Adlemann, L., Huang, M.-D., Algorithmic Number Theory, First Int. Symp., ANTS-1,Lect. Notes Comput. Sci.1994),877, p. 28\u201340","DOI":"10.1007\/3-540-58691-1_39"},{"key":"10.1049\/iet-ifs:20070003_r37","first-page":"83","volume":"102","author":"Enge","year":"2002"},{"key":"10.1049\/iet-ifs:20070003_r38","first-page":"339","volume":"4","author":"Flassenberg","year":"1999"},{"key":"10.1049\/iet-ifs:20070003_r39","doi-asserted-by":"crossref","unstructured":"Gaudry, P.: \u2018An algorithm for solving the discrete log problem on hyperelliptic curves\u2019, Preneel, B., Advances in Cryptology\u2013 EUROCRYPT, 2000),Lect. Notes Comput. Sci., 20001807, p. 19\u201334","DOI":"10.1007\/3-540-45539-6_2"},{"key":"10.1049\/iet-ifs:20070003_r40","doi-asserted-by":"crossref","unstructured":"The\u0301riault, N.: \u2018Index calculus attack for hyperelliptic curves of small genus\u2019, Goos, G., Hartmanis, J., van Leeuwen, J., Advances in Cryptology \u2013 ASIACRYPT '03,Lect. Notes Comput. Sci.2003),2894, p. 79\u201392","DOI":"10.1007\/978-3-540-40061-5_5"},{"key":"10.1049\/iet-ifs:20070003_r41","unstructured":"\u2018A double large prime variation for small genus hyperelliptic index calculus\u2019, Cryptology ePrint Archive Report, Report 2004\/153, 2004, http:\/\/eprint.iacr.org"},{"key":"10.1049\/iet-ifs:20070003_r42","unstructured":"\u2018Improvement of The\u0301riault algorithm of index calculus for Jacobian of hyperelliptic curves of small genus\u2019, Cryptology ePrint Archive Report, Report 2004\/161, 2004 http:\/\/eprint.iacr.org"},{"key":"10.1049\/iet-ifs:20070003_r43","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"Gaudry","year":"2002","ISSN":"https:\/\/id.crossref.org\/issn\/0933-2790","issn-type":"print"},{"key":"10.1049\/iet-ifs:20070003_r44","doi-asserted-by":"crossref","unstructured":"Hess, F.: \u2018The GHS attack revisited\u2019, Biham, E., Advances in Cryptology \u2013 EUROCRYPT 2003\u2019,Lect. Notes Comput. Sci., 2003),2656, p. 374\u2013387","DOI":"10.1007\/3-540-39200-9_23"},{"key":"10.1049\/iet-ifs:20070003_r45","unstructured":"\u2018Cryptographic implications of Hess' generalized GHS attack\u2019, Cryptology ePrint Archive Report, Report 2004\/235, 2004 http:\/\/eprint.iacr.org"},{"key":"10.1049\/iet-ifs:20070003_r46","first-page":"595","volume":"7","author":"Karatsuba","year":"1963"},{"key":"10.1049\/iet-ifs:20070003_r47","unstructured":"Knuth, D.E.: \u2018The art of computer programming, Volume 2: Seminumerical algorithm\u2019, 3rd(Addison-Wesley, Reading, MA, USA 1997)"},{"key":"10.1049\/iet-ifs:20070003_r48","unstructured":"\u2018Generalizations of the Karatsuba algorithm for efficient implementations\u2019, Cryptology ePrint Archive Report, Report 2006\/224, 2006 http:\/\/eprint.iacr.org"},{"key":"10.1049\/iet-ifs:20070003_r49","doi-asserted-by":"crossref","unstructured":"Cohen, H.: \u2018A course in computational algebraic number theory, ser. Graduate texts in math. 138\u2019, (Springer-Verlag, Berlin, Germany 1993),fourth corrected printing, 2000","DOI":"10.1007\/978-3-662-02945-9"},{"key":"10.1049\/iet-ifs:20070003_r50","unstructured":"Takahashi, M.: \u2018Improving Harley algorithm for Jacobian of genus 2 hyperelliptic curves\u2019, The 2002 Symp. on Cryptography and Information Security \u2013 SCIS 2002, (IEICE, Japan 2002),in Japanese"},{"key":"10.1049\/iet-ifs:20070003_r51","unstructured":"von zur Gathen, J., and Gerhard, J.: \u2018Modern computer algebra\u2019, Graduate Texts in Math. 138, (Cambridge University Press, Cambridge, UK 1999)"},{"key":"10.1049\/iet-ifs:20070003_r52","doi-asserted-by":"crossref","unstructured":"Lange, T., and Stevens, M.: \u2018Efficient doubling for genus two curves over binary fields\u2019, Handschuh, H., Hasan, M.A., Eleventh Annual Workshop on Selected Areas in Cryptography \u2013 SAC 2004,Lect. Notes Comput. Sci.2005),3357, p. 170\u2013181","DOI":"10.1007\/978-3-540-30564-4_12"},{"key":"10.1049\/iet-ifs:20070003_r53","first-page":"729","volume":"342","author":"Lockhart","year":"1994"},{"key":"10.1049\/iet-ifs:20070003_r54","doi-asserted-by":"crossref","unstructured":"Blake, I., Seroussi, G., and Smart, N.: \u2018Elliptic curves in cryptography\u2019, (Cambridge University Press, Cambridge, UK 1999),London Mathematical Society Lecture Note Series, no. 265","DOI":"10.1017\/CBO9781107360211"}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/digital-library.theiet.org\/content\/journals\/10.1049\/iet-ifs_20070003?crawler=true&mimetype=application\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T16:24:47Z","timestamp":1731428687000},"score":1,"resource":{"primary":{"URL":"http:\/\/digital-library.theiet.org\/doi\/10.1049\/iet-ifs%3A20070003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6,11]]}},"alternative-id":["10.1049\/iet-ifs:20070003"],"URL":"https:\/\/doi.org\/10.1049\/iet-ifs:20070003","relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"value":"1751-8709","type":"print"},{"value":"1751-8717","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,11]]}}}