{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:29Z","timestamp":1725536849859},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041587"},{"type":"electronic","value":"9783642041594"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04159-4_2","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T05:19:34Z","timestamp":1250918374000},"page":"18-34","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates"],"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":"2_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":"2_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 h\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":"2_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, p. 354. Springer, Heidelberg (2002)"},{"issue":"3","key":"2_CR4","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":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11496618_13","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"S. Chatterjee","year":"2005","unstructured":"Chatterjee, S., Sarkar, P., Barua, R.: Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 168\u2013181. Springer, Heidelberg (2005)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"2_CR8","unstructured":"Cocks, C., Pinch, R.G.E.: Identity-based Cryptosystems Based on the Weil Pairing (Unpublished manuscript) (2001)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I.M. Duursma","year":"2003","unstructured":"Duursma, I.M., Lee, H.-S.: Tate pairing implementation for hyperelliptic curves y\n                  2\u2009=\u2009x\n                  \n                    p\n                  \u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"issue":"4","key":"2_CR10","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":"2_CR11","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":"2_CR12","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":"2_CR13","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 Problem in the Divisor Class Group of Curves. Mathematics of Computation\u00a062(206), 865\u2013874 (1994)","journal-title":"Mathematics of Computation"},{"key":"2_CR14","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":"2_CR15","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":"2_CR16","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. \\\u2019{O} h\\\u2019{E}igeartaigh","year":"2007","unstructured":"\u00d3 h\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":"2_CR17","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":"2_CR18","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":"2_CR19","series-title":"LNCS 1838","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 1838, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"issue":"7","key":"2_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 (English Translation)\u00a07(7), 595\u2013596 (1963)","journal-title":"Soviet Physics Doklady. (English Translation)"},{"key":"2_CR21","unstructured":"Kawazoe, M., Takahashi, T.: Pairing-friendly Hyperelliptic Curves of Type y2 = x5 + ax, Cryptology ePrint Archive, Report 2008\/026 (2008), \n                    \n                      http:\/\/eprint.iacr.org\/2008\/026"},{"issue":"5","key":"2_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00200-004-0154-8","volume":"15","author":"T. Lange","year":"2005","unstructured":"Lange, T.: Formulae for Arithmetic on Genus 2 Hyperelliptic Curves. Applicable Algebra in Engineering, Communication and Computing\u00a015(5), 295\u2013328 (2005)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"2_CR23","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":"2_CR24","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":"2_CR25","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. Chapman & Hall\/CRC, Boca Raton (1997)"},{"key":"2_CR26","unstructured":"Miller, V.S.: Short Programs for Functions on Curves (Unpublished manuscript) (1986), \n                    \n                      http:\/\/crypto.stanford.edu\/miller\/miller.pdf"},{"key":"2_CR27","unstructured":"Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., Tsujii, S.: A Fast Addition Algorithm of Genus Two Hyperelliptic Curve. In: The 2002 Symposium on Cryptography and Information Security - SCIS 2002, pp. 497\u2013502 (2002) (in Japanese)"},{"key":"2_CR28","unstructured":"Mumford, D.: Tata Lectures on Theta II. In: Prog. Math., vol.\u00a043. Birkh\u00e4user (1984)"},{"key":"2_CR29","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":"2_CR30","unstructured":"Scott, M.: MIRACL (Multiprecision Integer and Rational Arithmetic C\/C++ Library), \n                    \n                      http:\/\/www.shamus.ie\/"},{"key":"2_CR31","unstructured":"Scott, M.: Scaling Security in Pairing-based Protocols, Cryptology ePrint Archive, Report 2005\/139 (2005), \n                    \n                      http:\/\/eprint.iacr.org\/2005\/139"},{"key":"2_CR32","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"}],"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-642-04159-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T13:48:32Z","timestamp":1552139312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04159-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041587","9783642041594"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04159-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}