{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T14:08:20Z","timestamp":1778335700089,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,2,23]],"date-time":"2007-02-23T00:00:00Z","timestamp":1172188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2007,3,5]]},"DOI":"10.1007\/s10623-006-9033-6","type":"journal-article","created":{"date-parts":[[2007,2,22]],"date-time":"2007-02-22T17:13:49Z","timestamp":1172164429000},"page":"239-271","source":"Crossref","is-referenced-by-count":250,"title":["Efficient pairing computation on supersingular Abelian varieties"],"prefix":"10.1007","volume":"42","author":[{"given":"Paulo S. L. M.","family":"Barreto","sequence":"first","affiliation":[]},{"given":"Steven D.","family":"Galbraith","sequence":"additional","affiliation":[]},{"given":"Colm \u00d3\u2019","family":"h\u00c9igeartaigh","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Scott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,2,23]]},"reference":[{"key":"9033_CR1","unstructured":"Barreto PSLM (2004) A note on efficient computation of cube roots in characteristic 3. Cryptology ePrint Archive, Report 2004\/305, 2004. Available from http:\/\/ eprint.iacr.org\/2004\/305"},{"key":"9033_CR2","doi-asserted-by":"crossref","unstructured":"Barreto PSLM, Kim HY, Lynn B, Scott M (2002) Efficient algorithms for pairing-based cryptosystems. In: Yung M (ed) Advances in cryptology\u2014crypto\u20192002. Lecture notes in computer science, vol 2442. Springer, Berlin Heidelberg, New York, pp 354\u2013368","DOI":"10.1007\/3-540-45708-9_23"},{"key":"9033_CR3","doi-asserted-by":"crossref","unstructured":"Barreto PSLM, Lynn B, Scott M (2004) Efficient implementation of pairing-based cryptosystems. J Cryptol 17(4):321\u2013334","DOI":"10.1007\/s00145-004-0311-z"},{"key":"9033_CR4","doi-asserted-by":"crossref","unstructured":"Barreto PSLM, Naehrig M (2005) Pairing-friendly elliptic curves of prime order. In: Preneel B, Tavares SE (eds) Selected areas in cryptography \u2013 SAC\u20192005. Lecture notes in computer science, vol 3897. Springer, Berlin Heidelberg NewYork, pp 319\u2013331","DOI":"10.1007\/11693383_22"},{"key":"9033_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546570","volume-title":"Advances in elliptic curve cryptography","author":"IF Blake","year":"2005","unstructured":"Blake IF, Seroussi G, Smart NP (2005) Advances in elliptic curve cryptography. Cambridge University Press, Cambridge"},{"issue":"3","key":"9033_CR6","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"Boneh D, Franklin M (2003) Identity-based encryption from the Weil pairing. SIAM J Comput 32(3):586\u2013615","journal-title":"SIAM J Comput"},{"issue":"177","key":"9033_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"DG Cantor","year":"1987","unstructured":"Cantor DG (1987) Computing in the Jacobian of a hyperelliptic curve. Math Comput 48(177): 95\u2013101","journal-title":"Math Comput"},{"key":"9033_CR8","doi-asserted-by":"crossref","unstructured":"Duursma I, Lee H-S (2003) Tate pairing implementation for hyperelliptic curves y 2 =\u00a0 x p \u2212 x +\u00a0 d. In: Laih CS (ed) Advances in cryptology\u2014asiacrypt\u20192003. Lecture notes in computer science, vol 2894. Springer, Berlin Heidelberg New York, pp 111\u2013123","DOI":"10.1007\/978-3-540-40061-5_7"},{"key":"9033_CR9","doi-asserted-by":"crossref","unstructured":"Duursma I, Sakurai K (2000) Efficient algorithms for the Jacobian variety of hyperelliptic curves y 2\u00a0=\u00a0x p \u2212x\u00a0+\u00a01 over a finite field of odd characteristic p. In: Buchmann J, Hoholdt T, Stichtenoth H, Tapia-Recillas H (eds) Coding theory, cryptography and related areas (Guanajuato, 1998). Springer, Berlin Heidelberg New York, pp 73\u201389","DOI":"10.1007\/978-3-642-57189-3_6"},{"issue":"8","key":"9033_CR10","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K Fong","year":"2004","unstructured":"Fong K, Hankerson D, L\u00f3pez J, Menezes A (2004) Field inversion and point halving revisited. IEEE Trans Comput 53(8):1047\u20131059","journal-title":"IEEE Trans Comput"},{"key":"9033_CR11","doi-asserted-by":"crossref","unstructured":"Frey G, Lange T (2006) Fast bilinear maps from the Tate\u2013Lichtenbaum pairing on hyperelliptic curves. In: Hess F et\u00a0al (eds) ANTS VII. Lecture notes in computer science, vol 4076. Springer, Berlin Heidelberg New York, pp 466\u2013479","DOI":"10.1007\/11792086_33"},{"key":"9033_CR12","first-page":"865","volume":"52","author":"G Frey","year":"1994","unstructured":"Frey G, R\u00fcck H-G (1994) A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves. Math Comput 52:865\u2013874","journal-title":"Math Comput"},{"key":"9033_CR13","doi-asserted-by":"crossref","unstructured":"Galbraith SD, Harrison K, Soldera D (2002) Implementing the Tate pairing. In: Goos G, Hartmanis J, van Leeuwen J (eds) Algorithmic number theory\u2014ANTS V. Lecture notes in computer science, vol 2369. Springer, Berlin Heidelberg New York, pp 324\u2013337","DOI":"10.1007\/3-540-45455-1_26"},{"key":"9033_CR14","doi-asserted-by":"crossref","unstructured":"Galbraith SD (2001) Supersingular curves in cryptography. In: Boyd C (ed) ASIACRYPT 2001. Lecture notes in computer science, vol 2248. Springer, Berlin Heidelberg New York, pp 495\u2013513","DOI":"10.1007\/3-540-45682-1_29"},{"key":"9033_CR15","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1112\/S1461157000001194","volume":"9","author":"R Granger","year":"2006","unstructured":"Granger R, Page D, Stam M (2006) On small characteristic algebraic tori in pairing-based cryptography. LMS J Comput Math 9:64\u201385","journal-title":"LMS J Comput Math"},{"key":"9033_CR16","first-page":"296","volume-title":"ICISC 2004, vol 3506.","author":"M Katagi","year":"2005","unstructured":"Katagi M, Akishita T, Kitamura I, Takagi T (2005). Some improved algorithms for hyperelliptic curve cryptosystems using degenerate divisors. In: Park C, Chee S (eds) ICISC 2004, vol 3506. Springer, Berlin Heidelberg New York, pp 296\u2013312"},{"key":"9033_CR17","doi-asserted-by":"crossref","unstructured":"Katagi M, Kitamura I, Akishita T, Takagi T (2005) Novel efficient implementations of hyperelliptic curve cryptosystems using degenerate divisors. In: Lim CH, Yung M (eds) Information security applications\u2014WISA\u20192004. Lecture notes in computer science, vol 3325. Springer, Berlin Heidelberg New York, pp 345\u2013359","DOI":"10.1007\/978-3-540-31815-6_28"},{"issue":"3","key":"9033_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N Koblitz","year":"1989","unstructured":"Koblitz N (1989) Hyperelliptic cryptosystems. J Cryptol 1(3):139\u2013150","journal-title":"J Cryptol"},{"key":"9033_CR19","doi-asserted-by":"crossref","unstructured":"Kwon S (2005) Efficient Tate pairing computation for supersingular elliptic curves over binary fields. In: Boyd C, Nieto JMG (eds) ACISP 2005. Lecture notes in computer science, vol 3574. Springer, Berlin Heidelberg, New York. pp 134\u2013145","DOI":"10.1007\/11506157_12"},{"key":"9033_CR20","unstructured":"Lange T (2004) Formulae for arithmetic on genus 2 hyperelliptic curves. In: Applicable algebra in engineering, communication and computing, Online publication. Springer, Berlin Heidelberg New York. http:\/\/www.springerlink.com\/openurl.asp?genre=article&id=doi:10.1007\/s0 0200-004-0154-8"},{"key":"9033_CR21","doi-asserted-by":"crossref","unstructured":"Lange T, Stevens M (2004) Efficient doubling on genus two curves over binary fields. In: Handschuh H, Anwar Hasan M (eds) Selected areas in cryptography\u2014SAC\u20192004. Lecture notes in computer science, vol 3357. Springer, Berlin Heidelberg New York, pp 170\u2013181","DOI":"10.1007\/978-3-540-30564-4_12"},{"key":"9033_CR22","doi-asserted-by":"crossref","unstructured":"Rubin K, Silverberg A (2002) Supersingular abelian varieties in cryptology. In: Yung M (ed) Advances in cryptology\u2014crypto\u20192002. Lecture notes in computer science, vol 2442. Springer, Berlin Heidelberg New York, pp 336\u2013353","DOI":"10.1007\/3-540-45708-9_22"},{"key":"9033_CR23","doi-asserted-by":"crossref","unstructured":"Rubin K, Silverberg A (2004) Using primitive subgroups to do more with fewer bits. In: Buell D (ed) Algorithmic number theory\u2014ANTS VI. Lecture notes in computer science, vol 3076. Springer, Berlin Heidelberg New York, pp 18\u201341","DOI":"10.1007\/978-3-540-24847-7_2"},{"issue":"14","key":"9033_CR24","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1049\/el:20045081","volume":"40","author":"M Scott","year":"2004","unstructured":"Scott M (2004) Faster identity based encryption. Electron Lett 40(14):861","journal-title":"Electron Lett"},{"key":"9033_CR25","doi-asserted-by":"crossref","unstructured":"Scott M, Barreto P (2004) Compressed pairings. In: Franklin M (ed) Advances in cryptology\u2014crypto\u20192004. Lecture notes in computer science, vol 3152. Springer, Berlin Heidelberg New York, pp~140\u2013156. Also available from http:\/\/eprint.iacr.org\/2004\/032\/","DOI":"10.1007\/978-3-540-28628-8_9"},{"key":"9033_CR26","first-page":"93","volume":"8","author":"A Silverberg","year":"2005","unstructured":"Silverberg A (2005) Compression for trace zero subgroups of elliptic curves. Trends Math 8:93\u2013100","journal-title":"Trends Math"},{"key":"9033_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The arithmetic of elliptic curves. Graduate texts in mathematics 106","author":"JH Silverman","year":"1986","unstructured":"Silverman JH (1986) The arithmetic of elliptic curves. Graduate texts in mathematics 106. Springer, Berlin Heidelberg New York"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9033-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-006-9033-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-006-9033-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:50:07Z","timestamp":1559231407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-006-9033-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,23]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,3,5]]}},"alternative-id":["9033"],"URL":"https:\/\/doi.org\/10.1007\/s10623-006-9033-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,23]]}}}