{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:11:47Z","timestamp":1725574307265},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213765"},{"type":"electronic","value":"9783540246916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24691-6_9","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T08:20:22Z","timestamp":1294388422000},"page":"97-111","source":"Crossref","is-referenced-by-count":14,"title":["Implementation of Tate Pairing on Hyperelliptic Curves of Genus 2"],"prefix":"10.1007","author":[{"given":"YoungJu","family":"Choie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunjeong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based Encryption from the Weil paring. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"9_CR2","unstructured":"Barreto, P.S., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. Cryptology eprint Archives (2002), Number 2002\/008, Available at \n                    \n                      http:\/\/eprint.iacr.org"},{"key":"9_CR3","unstructured":"Barreto, P., Lynn, B., Scott, M.: On the Selection of Pairing-Friendly Groups, Cryptology eprint Archives (2003), Number 2003\/086, Available at \n                    \n                      http:\/\/eprint.iacr.org"},{"issue":"177","key":"9_CR4","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 Curves. Math. Comp.\u00a048(177), 95\u2013101 (1987)","journal-title":"Math. Comp."},{"key":"9_CR5","unstructured":"Choie, Y., Jeong, E., Lee, E.: Supersingular Hyperelliptic Curves of Genus 2 over Finite Fields. Cryptology eprint Archives (2002), Number 2002\/032, Available at \n                    \n                      http:\/\/eprint.iacr.org"},{"key":"9_CR6","unstructured":"Duursma, I., Lee, H.: Tate-priring implementations for tripartite key agreement. Cryptology eprint Archives (2003), Number 2003\/053, Available at \n                    \n                      http:\/\/eprint.iacr.org"},{"issue":"206","key":"9_CR7","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility in the divisor class group of curves. Math. Comp.\u00a062(206), 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"9_CR8","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. Galbraith","year":"2001","unstructured":"Galbraith, S.: Supersingular curves in Cryptography. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 495\u2013513. Springer, Heidelberg (2001)"},{"key":"9_CR9","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. Galbraith","year":"2002","unstructured":"Galbraith, S., 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":"9_CR10","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\u2013393. Springer, Heidelberg (2000)"},{"issue":"7","key":"9_CR11","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Sov. Phys.-Dokl (Engl. transl.)\u00a07(7), 595\u2013596 (1963)","journal-title":"Sov. Phys.-Dokl. (Engl. transl.)"},{"key":"9_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03642-6","volume-title":"Algebraic aspects of cryptography","author":"N. Koblitz","year":"1998","unstructured":"Koblitz, N.: Algebraic aspects of cryptography. Springer, Heidelberg (1998)"},{"key":"9_CR13","unstructured":"Lange, T.: Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. Cryptology eprint Archives (2002), Number 2002\/121, Available at \n                    \n                      http:\/\/eprint.iacr.org"},{"key":"9_CR14","unstructured":"Miller, V.: Short Programs for Functions on Curves, Unpublished manuscript (1986)"},{"key":"9_CR15","unstructured":"Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., Tsuji, S.: A fast addition algorithm of genus two hyperellipitc curve. In: Proc. of SCIS 2002, IEICE Japan, pp. 497\u2013502 (2002) (in Japanese)"},{"issue":"5","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.Q.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Thans. Inf. Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Thans. Inf. Theory"},{"key":"9_CR17","volume-title":"Tata Lectures on Theta II","author":"D. Mumford","year":"1984","unstructured":"Mumford, D.: Tata Lectures on Theta II. Birkh\u00e4user, Basel (1984)"},{"issue":"18","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1049\/el:20020682","volume":"38","author":"K.G. Paterson","year":"2002","unstructured":"Paterson, K.G.: ID-based signature from pairings on elliptic curves. Electronis Letters\u00a038(18), 1025\u20131026 (2002)","journal-title":"Electronis Letters"},{"key":"9_CR19","unstructured":"Pelzl, J., Wollinger, T., Guajardo, J., Paar, C.: Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves (Update). Cryptology eprint Archives (2003), Number 2003\/026, Available at \n                    \n                      http:\/\/eprint.iacr.org"},{"key":"9_CR20","unstructured":"Rubin, K., Silverberg, A.: The Best and Worst of Supersingular Abelian Varieties in Cryptology. Cryptology eprint Archives (2002), Number 2002\/121, Available at \n                    \n                      http:\/\/eprint.iacr.org"},{"key":"9_CR21","unstructured":"Sakai, R., Kasahara, M.: ID based Cryptosystems with Pairing on Elliptic Curve, Cryptology eprint Archives (2003), Number 2003\/054, Available at \n                    \n                      http:\/\/eprint.iacr.org"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-48910-X_12","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"N.P. Smart","year":"1999","unstructured":"Smart, N.P.: On the Performance of Hyperelliptic Cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 165\u2013175. Springer, Heidelberg (1999)"},{"key":"9_CR23","volume-title":"Algebraic Function Fields and Codes","author":"H. Stichtenoth","year":"1993","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes. Springer, Heidelberg (1993)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","first-page":"433","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"E.R. Verheul","year":"2001","unstructured":"Verheul, E.R.: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 433\u2013551. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24691-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T04:43:15Z","timestamp":1553316195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24691-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213765","9783540246916"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24691-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}