{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:21:39Z","timestamp":1745986899270,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642363337"},{"type":"electronic","value":"9783642363344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36334-4_1","type":"book-chapter","created":{"date-parts":[[2013,1,31]],"date-time":"2013-01-31T00:55:13Z","timestamp":1359593713000},"page":"1-18","source":"Crossref","is-referenced-by-count":4,"title":["On Efficient Pairings on Elliptic Curves over Extension Fields"],"prefix":"10.1007","author":[{"given":"Xusheng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Kunpeng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D.V. Bailey","year":"1998","unstructured":"Bailey, D.V., Paar, C.: Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 472\u2013485. Springer, Heidelberg (1998)"},{"issue":"3","key":"1_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"D.V. Bailey","year":"2001","unstructured":"Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology\u00a014(3), 153\u2013176 (2001)","journal-title":"Journal of Cryptology"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Imbert, L., Negre, C., Plantard, T.: Efficient multiplication in GF(pk) for elliptic curve cryptography. In: Proceedings of the 16th IEEE Symposium on Computer Arithmetic 2003, pp. 181\u2013187. IEEE (2003)","DOI":"10.1109\/ARITH.2003.1207677"},{"key":"1_CR4","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\u2013369. Springer, Heidelberg (2002)"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., h\u00c9igeartaigh, C.\u00d3., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-03298-1_4","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"N. Benger","year":"2009","unstructured":"Benger, N., Charlemagne, M., Freeman, D.M.: On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 52\u201365. Springer, Heidelberg (2009)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13013-7_14","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C. Costello","year":"2010","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster Pairing Computations on Curves with High-Degree Twists. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 224\u2013242. Springer, Heidelberg (2010)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-14712-8_6","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"C. Costello","year":"2010","unstructured":"Costello, C., Stebila, D.: Fixed argument pairings. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol.\u00a06212, pp. 92\u2013108. Springer, Heidelberg (2010)"},{"issue":"1","key":"1_CR9","first-page":"1","volume":"18","author":"C. Diem","year":"2003","unstructured":"Diem, C.: The GHS attack in odd characteristic. J. Ramanujan Math. Soc.\u00a018(1), 1\u201332 (2003)","journal-title":"J. Ramanujan Math. Soc."},{"issue":"01","key":"1_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/S0010437X10005075","volume":"147","author":"C. Diem","year":"2011","unstructured":"Diem, C.: On the discrete logarithm problem in elliptic curves. Compositio Mathematica\u00a0147(01), 75\u2013104 (2011)","journal-title":"Compositio Mathematica"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-17455-1_25","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"N. Estibals","year":"2010","unstructured":"Estibals, N.: Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 397\u2013416. Springer, Heidelberg (2010)"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D. Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A Taxonomy of Pairing-Friendly Elliptic Curves. Journal of Cryptology\u00a023(2), 224\u2013280 (2010)","journal-title":"Journal of Cryptology"},{"key":"1_CR13","unstructured":"Frey, G., Gangl, H.: How to disguise an elliptic curve (Weil descent). In: Talk at ECC 1998, vol.\u00a098 (1998)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-46035-7_3","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Hess, F., Smart, N.P.: Extending the GHS Weil Descent Attack. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 29\u201344. Springer, Heidelberg (2002)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-46665-7_23","volume-title":"IMA-Crypto & Coding 1999","author":"S.D. Galbraith","year":"1999","unstructured":"Galbraith, S.D., Smart, N.P.: A Cryptographic Application of Weil Descent. In: Walker, M. (ed.) IMA - Crypto & Coding 1999. LNCS, vol.\u00a01746, pp. 191\u2013200. Springer, Heidelberg (1999)"},{"issue":"12","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.jsc.2008.08.005","volume":"44","author":"P. Gaudry","year":"2009","unstructured":"Gaudry, P.: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. Journal of Symbolic Computation\u00a044(12), 1690\u20131702 (2009)","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P. Gaudry","year":"2002","unstructured":"Gaudry, P., Hess, F., Smart, N.P.: Constructive and destructive facets of Weil descent on elliptic curves. Journal of Cryptology\u00a015(1), 19\u201346 (2002)","journal-title":"Journal of Cryptology"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-17373-8_17","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"R. Granger","year":"2010","unstructured":"Granger, R.: On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 283\u2013302. Springer, Heidelberg (2010)"},{"key":"1_CR19","unstructured":"Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive Report 2006\/172 (2006), Preprint available at http:\/\/eprint.iacr.org\/2006\/172"},{"issue":"1","key":"1_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1112\/S146115700000108X","volume":"7","author":"F. Hess","year":"2004","unstructured":"Hess, F.: Generalising the GHS attack on the elliptic curve discrete logarithm problem. LMS Journal of Computation and Mathematics\u00a07(1), 167\u2013192 (2004)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-85538-5_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"F. Hess","year":"2008","unstructured":"Hess, F.: Pairing Lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 18\u201338. Springer, Heidelberg (2008)"},{"issue":"10","key":"1_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 Trans. on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. on Information Theory"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-73489-5_16","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"L. Hitt","year":"2007","unstructured":"Hitt, L.: On the Minimal Embedding Field. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 294\u2013301. Springer, Heidelberg (2007)"},{"key":"1_CR24","unstructured":"Joux, A., Vitse, V.: Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields. Application to the static Diffie-Hellman problem on $E(\\mathbb{F}_{q^5})$ . Cryptology ePrint Archive, Report 2010\/157 (2010), Preprint available at http:\/\/eprint.iacr.org\/2010\/157"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N. Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-Based Cryptography at High Security Levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"issue":"4","key":"1_CR26","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E. Lee","year":"2009","unstructured":"Lee, E., Lee, H.S., Park, C.M.: Efficient and generalized pairing computation on abelian varieties. IEEE Trans. on Information Theory\u00a055(4), 1793\u20131803 (2009)","journal-title":"IEEE Trans. on Information Theory"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-46588-1_27","volume-title":"Public Key Cryptography","author":"C.H. Lim","year":"2000","unstructured":"Lim, C.H., Hwang, H.S.: Fast Implementation of Elliptic Curve Arithmetic in GF(p n ). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 405\u2013421. Springer, Heidelberg (2000)"},{"issue":"6","key":"1_CR28","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00200-005-0186-8","volume":"16","author":"A. Menezes","year":"2006","unstructured":"Menezes, A., Teske, E.: Cryptographic implications of Hess\u2019 generalized GHS attack. Applicable Algebra in Engineering, Communication and Computing\u00a016(6), 439\u2013460 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"4","key":"1_CR29","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V. Miller","year":"2004","unstructured":"Miller, V.: The Weil pairing, and its efficient calculation. Journal of Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-14423-3_4","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"Y. Sakemi","year":"2010","unstructured":"Sakemi, Y., Takeuchi, S., Nogami, Y., Morikawa, Y.: Accelerating Twisted Ate Pairing with Frobenius Map, Small Scalar Multiplication, and Multi-pairing. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol.\u00a05984, pp. 47\u201364. Springer, Heidelberg (2010)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30574-3_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M. Scott","year":"2005","unstructured":"Scott, M.: Computing the Tate Pairing. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 293\u2013304. Springer, Heidelberg (2005)"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-25516-8_18","volume-title":"Cryptography and Coding","author":"M. Scott","year":"2011","unstructured":"Scott, M.: On the Efficient Implementation of Pairing-Based Protocols. In: Chen, L. (ed.) Cryptography and Coding 2011. LNCS, vol.\u00a07089, pp. 296\u2013308. Springer, Heidelberg (2011)"},{"issue":"1","key":"1_CR33","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F. Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal Pairings. IEEE Trans. on Information Theory\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. on Information Theory"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-25516-8_19","volume-title":"Cryptography and Coding","author":"X. Zhang","year":"2011","unstructured":"Zhang, X., Lin, D.: Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2. In: Chen, L. (ed.) IMACC 2011. LNCS, vol.\u00a07089, pp. 309\u2013326. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36334-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T18:58:07Z","timestamp":1745953087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36334-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363337","9783642363344"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36334-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}