{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:30:08Z","timestamp":1725517808762},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540855033"},{"type":"electronic","value":"9783540855385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85538-5_17","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T00:12:35Z","timestamp":1219623155000},"page":"243-264","source":"Crossref","is-referenced-by-count":3,"title":["Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms"],"prefix":"10.1007","author":[{"given":"Xinxin","family":"Fan","sequence":"first","affiliation":[]},{"given":"Guang","family":"Gong","sequence":"additional","affiliation":[]},{"given":"David","family":"Jao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"R.M. Avanzi","year":"2006","unstructured":"Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall\/CRC, Boca Raton (2006)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.L.S.M. Barreto","year":"2007","unstructured":"Barreto, P.L.S.M., Galbraith, S., \u00d3\u2019h\u00c9igeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Design, Codes and Cryptography\u00a042, 239\u2013271 (2007)","journal-title":"Design, Codes and Cryptography"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.L.S.M. Barreto","year":"2002","unstructured":"Barreto, P.L.S.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithm for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-540-24654-1_2","volume-title":"Selected Areas in Cryptography","author":"P.L.S.M. Barreto","year":"2004","unstructured":"Barreto, P.L.S.M., Lynn, B., Scott, M.: On the Selection of Pairing-Friendly Groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 17\u201325. Springer, Heidelberg (2004)"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. SIAM Journal of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM Journal of Computing"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-24691-6_9","volume-title":"Information Security and Cryptology - ICISC 2003","author":"Y. Choie","year":"2004","unstructured":"Choie, Y., Lee, E.: Implementation of Tate Pairing on Hyperelliptic Curve of Genus 2. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol.\u00a02971, pp. 97\u2013111. Springer, Heidelberg (2004)"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.amc.2004.03.030","volume":"163","author":"Y. Choie","year":"2005","unstructured":"Choie, Y., Jeong, E., Lee, E.: Supersingular Hyperelliptic Curves of Genus 2 over Finite Fields. Journal of Applied Mathematics and Computation\u00a0163(2), 565\u2013576 (2005)","journal-title":"Journal of Applied Mathematics and Computation"},{"key":"17_CR8","unstructured":"Cocks, C., Pinch, R.G.E.: Identity-based Cryptosystems Based on the Weil Pairing (unpublished manuscript, 2001)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-540-48000-6_10","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"I. Duursma","year":"1999","unstructured":"Duursma, I., Gaudry, P., Morain, F.: Speeding up the Discrete Log Computation on Curves with Automorphisms. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 103\u2013121. Springer, Heidelberg (1999)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I. Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.S.: Tate Pairing Implementation for Hyperelliptic Curves y\n                  2\u2009=\u2009x\n                  \n                    p\n                  \u2009\u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"17_CR11","unstructured":"Fan, X., Gong, G., Jao, D.: Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates. Centre for Applied Cryptographic Research (CACR) Technical Reports, CACR 2008-03, \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2008\/cacr2008-03.pdf"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-73489-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"D. Freeman","year":"2007","unstructured":"Freeman, D.: Constructing Pairing-Friendly Genus 2 Curves over Prime Fields with Ordinary Jacobians. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 152\u2013176. Springer, Heidelberg (2007)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/11792086_33","volume-title":"Algorithmic Number Theory","author":"G. Frey","year":"2006","unstructured":"Frey, G., Lange, T.: Fast Bilinear Maps from The Tate-Lichtenbaum Pairing on Hyperelliptic Curves. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 466\u2013479. Springer, Heidelberg (2006)"},{"issue":"206","key":"17_CR14","doi-asserted-by":"publisher","first-page":"865","DOI":"10.2307\/2153546","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A Remark Concerning m-Divisibility and the Discrete Logarithm Problem in the Divisor Class Group of Curves. Mathematics of Computation\u00a062(206), 865\u2013874 (1994)","journal-title":"Mathematics of Computation"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-540-24654-1_3","volume-title":"Selected Areas in Cryptography","author":"E. Furukawa","year":"2004","unstructured":"Furukawa, E., Kawazoe, M., Takahashi, T.: Counting Points for Hyperelliptic Curves of Type y\n                  2\u2009=\u2009x\n                  5\u2009+\u2009ax over Finite Prime Fields. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 26\u201341. Springer, Heidelberg (2004)"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ffa.2007.02.003","volume":"13","author":"S.D. Galbraith","year":"2007","unstructured":"Galbraith, S.D., McKee, J.F., Valen\u00e7a, P.C.: Ordinary Abelian Varieties Having Small Embedding Degree. Finite Fields and Their Applications\u00a013(4), 800\u2013814 (2007)","journal-title":"Finite Fields and Their Applications"},{"key":"17_CR17","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":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-72540-4_25","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R. Granger","year":"2007","unstructured":"Granger, R., Hess, F., Oyono, R., Th\u00e9riault, N., Vercauteren, F.: Ate Pairing on Hyperelliptic Curves. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 430\u2013447. Springer, Heidelberg (2007)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/11523468_44","volume-title":"Automata, Languages and Programming","author":"M. Haneda","year":"2005","unstructured":"Haneda, M., Kawazoe, M., Takahashi, T.: Suitable Curves for Genus-4 HEC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y\n                  2\u2009=\u2009x\n                  2k\u2009+\u20091\u2009+\u2009ax. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 539\u2013550. Springer, Heidelberg (2005)"},{"key":"17_CR20","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, New York (2004)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-74462-7_21","volume-title":"Selected Areas in Cryptography","author":"C. \u00d3h\u00c9igeartaigh","year":"2007","unstructured":"\u00d3\u2019h\u00c9igeartaigh, C., Scott, M.: Pairing Calculation on Supersingular Genus 2 Curves. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, pp. 302\u2013316. Springer, Heidelberg (2007)"},{"issue":"10","key":"17_CR22","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. Hess","year":"2006","unstructured":"Hess, F., Smart, N.P., Vercauteren, F.: The Eta Pairing Revisited. IEEE Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR23","unstructured":"Hitt, L.: Families of Genus 2 Curves with Small Embedding Degree, Cryptology ePrint Archive, Report 2007\/001 (2007), \n                    \n                      http:\/\/eprint.iacr.org\/2007\/001"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A One-Round Protocol for Tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"key":"17_CR25","unstructured":"Kawazoe, M., Takahashi, T.: Pairing-friendly Hyperelliptic Curves of Type y\n                  2\u2009=\u2009x\n                  5\u2009+\u2009ax, Cryptology ePrint Archive, Report 2008\/026 (2008) \n                    \n                      http:\/\/eprint.iacr.org\/2008\/026"},{"key":"17_CR26","unstructured":"Kozaki, S., Matsuo, K., Shimbara, Y.: Skew-Frobenius Maps on Hyperelliptic Curves. In: The 2007 Symposium on Cryptography and Information Security - SCIS 2007, IEICE Japan, pp. 1D2\u20134 (January 2007)"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-73489-5_20","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"E. Lee","year":"2007","unstructured":"Lee, E., Lee, H.-S., Lee, Y.: Eta Pairing Computation on General Divisors over Hyperelliptic Curves y\n                  2\u2009=\u2009x\n                  7\u2009\u2212\u2009x \u00b11. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 349\u2013366. Springer, Heidelberg (2007)"},{"issue":"5","key":"17_CR28","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Okamoto, T., Vanstone, S.A.: Reducing Elliptic Curve Logarithms to a Finite Field. IEEE Transactions on Information Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR29","unstructured":"Miller, V.S.: Short Programs for Functions on Curves (unpublished manuscript, 1986), \n                    \n                      http:\/\/crypto.stanford.edu\/miller\/miller.pdf"},{"issue":"4","key":"17_CR30","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil Pairing and Its Efficient Calculation. Journal of Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-46035-7_13","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"Y.-H. Park","year":"2002","unstructured":"Park, Y.-H., Jeong, S., Lim, J.: Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 197\u2013208. Springer, Heidelberg (2002)"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-45708-9_22","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"K. Rubin","year":"2002","unstructured":"Rubin, K., Silverberg, A.: Supersingular Abelian Varieties in Cryptography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 336\u2013353. Springer, Heidelberg (2002)"},{"key":"17_CR33","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems Based on Pairings. In: Proceedings of the 2000 Symposium on Cryptography and Information Security - SCIS 2002, Okinawa, Japan, pp. 26\u201328 (2000)"},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11596219_21","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"M. Scott","year":"2005","unstructured":"Scott, M.: Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol.\u00a03797, pp. 258\u2013269. Springer, Heidelberg (2005)"},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-28628-8_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Scott","year":"2004","unstructured":"Scott, M., Barreto, P.L.S.M.: Compressed Pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 140\u2013156. Springer, Heidelberg (2004)"},{"key":"17_CR36","series-title":"Graduate Texts in Mathematics 106","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"J.H. Silverman","year":"1986","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics 106. Springer, Heidelberg (1986)"},{"key":"17_CR37","unstructured":"Solinas, J.: Generalized Mersenne Primes, Centre for Applied Cryptographic Research (CACR) Technical Reports, CORR 99-39, \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca\/techreprots\/1999\/corr99-39.pdf"},{"issue":"1","key":"17_CR38","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1093\/ietfec\/e90-a.1.152","volume":"E90-A","author":"K. Takashima","year":"2007","unstructured":"Takashima, K.: Scaling Security of Elliptic Curves with Fast Pairing Using Efficient Endomorphism. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science\u00a0E90-A(1), 152\u2013159 (2007)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science"},{"key":"17_CR39","unstructured":"Zhao, C., Zhang, F., Huang, J.: Speeding Up the Bilinear Pairings Computation on Curves with Automorphisms, Cryptology ePrint Archive, Report 2006\/474 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/2006\/474"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85538-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:39:28Z","timestamp":1619509168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85538-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540855033","9783540855385"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85538-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}