{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:38:22Z","timestamp":1725471502943},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540360759"},{"type":"electronic","value":"9783540360766"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11792086_33","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T13:48:35Z","timestamp":1159969715000},"page":"466-479","source":"Crossref","is-referenced-by-count":11,"title":["Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves"],"prefix":"10.1007","author":[{"given":"Gerhard","family":"Frey","sequence":"first","affiliation":[]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"The Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"R. Avanzi","year":"2005","unstructured":"Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: The Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)"},{"key":"33_CR2","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., hEigeartaigh, C.O., Scott, M.: Efficient pairing computation on supersingular abelian varieties (preprint, 2004)"},{"key":"33_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.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"P.S.L.M. Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 257\u2013267. Springer, Heidelberg (2003)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order (preprint, 2005)","DOI":"10.1007\/11693383_22"},{"key":"33_CR6","unstructured":"Blake, I.F., Murty, K., Xu, G.: Refinements of Miller\u2019s algorithm for computing Weil\/Tate pairing (preprint, 2004)"},{"key":"33_CR7","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic curves in cryptography","author":"I.F. Blake","year":"1999","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic curves in cryptography. London Mathematical Society Lecture Note Series, vol.\u00a0265. Cambridge University Press, Cambridge (1999)"},{"key":"33_CR8","unstructured":"Bleichenbacher, D., Flammenkamp, A.: An efficient algorithm for computing shortest addition chains"},{"issue":"3","key":"33_CR9","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 J. Comput.\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"33_CR10","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":"33_CR11","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 the Jacobian of a hyperelliptic curve. Math. Comp.\u00a048, 95\u2013101 (1987)","journal-title":"Math. Comp."},{"key":"33_CR12","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 Curves 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":"33_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00145-004-0219-7","volume":"18","author":"R. Dupont","year":"2005","unstructured":"Dupont, R., Enge, A., Morain, F.: Building curves with arbitrary small MOV degree over finite prime fields. J. Cryptology\u00a018(2), 79\u201389 (2005)","journal-title":"J. Cryptology"},{"key":"33_CR14","unstructured":"Duursma, I., Lee, H.-S.: Tate-pairing implementations for tripartite key agreement (2003)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-36563-X_24","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"K. Eisentr\u00e4ger","year":"2003","unstructured":"Eisentr\u00e4ger, K., Lauter, K., Montgomery, P.L.: Fast elliptic curve arithmetic and improved Weil pairing evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 343\u2013354. Springer, Heidelberg (2003)"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-24847-7_12","volume-title":"Algorithmic Number Theory","author":"K. Eisentr\u00e4ger","year":"2004","unstructured":"Eisentr\u00e4ger, K., Lauter, K., Montgomery, P.L.: Improved Weil and Tate pairings for elliptic and hyperelliptic curves. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 169\u2013183. Springer, Heidelberg (2004)"},{"key":"33_CR17","unstructured":"Frey, G., Lange, T.: Mathematical background of public key cryptography. Technical Report\u00a010, IEM Essen. S\u00e9minaires et Congr\u00e8s (to appear, 2003)"},{"issue":"5","key":"33_CR18","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/18.771254","volume":"45","author":"G. Frey","year":"1999","unstructured":"Frey, G., M\u00fcller, M., R\u00fcck, H.G.: The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Trans. Inform. Theory\u00a045(5), 1717\u20131719 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"33_CR19","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. Math. Comp.\u00a062, 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"33_CR20","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\u2013513. Springer, Heidelberg (2001)"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"key":"33_CR22","unstructured":"Gaudry, P., Th\u00e9riault, N., Thom\u00e9, E., Diem, C.: A double large prime variation for small genus hyperelliptic index calculus (last update November 21, 2005) (preprint, 2005)"},{"key":"33_CR23","first-page":"119","volume":"19","author":"C. Guyot","year":"2004","unstructured":"Guyot, C., Kaveh, K., Patankar, V.M.: Explicit algorithm for the arithmetic on the hyperelliptic Jacobians of genus 3. J. Ramanujan Math. Soc.\u00a019, 119\u2013159 (2004)","journal-title":"J. Ramanujan Math. Soc."},{"key":"33_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45537-X_14","volume-title":"Selected Areas in Cryptography","author":"F. Hess","year":"2001","unstructured":"Hess, F., Seroussi, G., Smart, N.P.: Two topics in hyperelliptic cryptography. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 181\u2013189. Springer, Heidelberg (2001)"},{"key":"33_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-36552-4_20","volume-title":"Information Security and Cryptology - ICISC 2002","author":"T. Izu","year":"2003","unstructured":"Izu, T., Takagi, T.: Efficient computations of the Tate pairing for the large MOV degrees. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 283\u2013297. Springer, Heidelberg (2003)"},{"key":"33_CR26","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\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-31815-6_28","volume-title":"Information Security Applications","author":"M. Katagi","year":"2005","unstructured":"Katagi, M., Kitamura, I., Akishita, T., Takagi, T.: Novel efficient implementations of hyperelliptic curve cryptosystems using degenerate divisors. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol.\u00a03325, pp. 347\u2013361. Springer, Heidelberg (2005)"},{"key":"33_CR28","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"J. Cryptology"},{"issue":"5","key":"33_CR29","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. Appl. Algebra Engrg. Comm. Comput.\u00a015(5), 295\u2013328 (2005)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"33_CR30","doi-asserted-by":"crossref","unstructured":"Lorenzini, D.: An invitation to arithmetic geometry. Graduate studies in mathematics, vol.\u00a09. AMS (1996)","DOI":"10.1090\/gsm\/009"},{"key":"33_CR31","unstructured":"Miller, V.S.: Short programs for functions on curves. IBM, Thomas J. Watson Research Center (1986)"},{"key":"33_CR32","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.C. Miller","year":"2004","unstructured":"Miller, V.C.: The Weil Pairing, and Its Efficient Calculation. J. Cryptology\u00a017, 235\u2013261 (2004)","journal-title":"J. Cryptology"},{"issue":"5","key":"33_CR33","first-page":"1234","volume":"E84-A","author":"A. Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals\u00a0E84-A(5), 1234\u20131243 (2001)","journal-title":"IEICE Trans. Fundamentals"},{"key":"33_CR34","unstructured":"Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., Tsuji, S.: A fast addition algorithm of genus two hyperelliptic curve. In: Symposium on Cryptography and Information Security \u2013 SCIS 2002, pp. 497\u2013502 (2002) (in Japanese)"},{"key":"33_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44586-2_8","volume-title":"Public Key Cryptography","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Pointcheval, D.: The gap-problems: a new class of problems for the security of cryptographic schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 104\u2013118. Springer, Heidelberg (2001)"},{"key":"33_CR36","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: D.Walter, C., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 351\u2013365. Springer, Heidelberg (2003)"},{"key":"33_CR37","unstructured":"Rivest, R.L., Silverman, R.D.: Are \u201cstrong\u201d primes needed for RSA? (preprint, 1997)"},{"key":"33_CR38","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 problem in the divisor class group of curves. Math. Comp.\u00a068, 805\u2013806 (1999)","journal-title":"Math. Comp."},{"key":"33_CR39","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: Symposium on Cryptography and Information Security \u2013 SCIS 2000 (2000)"},{"key":"33_CR40","unstructured":"Stahlke, C.: Point compression on Jacobians of hyperelliptic curves over $\\mathbb{F}_q$ (preprint, 2004)"},{"key":"33_CR41","volume-title":"Algebraic Function Fields and Codes","author":"H. Stichtenoth","year":"1993","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes. Springer, Heidelberg (1993)"},{"key":"33_CR42","unstructured":"Sugizaki, H., Matsuo, K., Chao, J., Tsujii, S.: An Extension of Harley algorithm addition algorithm for hyperelliptic curves over finite fields of characteristic two. Technical Report ISEC2002-9(2002-5), IEICE (2002)"},{"key":"33_CR43","unstructured":"Takahashi, M.: Improving Harley algorithms for Jacobians of genus 2 hyperelliptic curves. In: Symposium on Cryptography and Information Security \u2013 SCIS 2002 (2002) (in Japanese)"},{"key":"33_CR44","unstructured":"Wollinger, T.: Software and Hardware Implementation of Hyperelliptic Curve Cryptosystems. PhD thesis, Ruhr-University of Bochum (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11792086_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:04Z","timestamp":1605643804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11792086_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540360759","9783540360766"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/11792086_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}