{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:10Z","timestamp":1742913130587,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174544"},{"type":"electronic","value":"9783642174551"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17455-1_1","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T15:31:49Z","timestamp":1290007909000},"page":"1-20","source":"Crossref","is-referenced-by-count":21,"title":["An Analysis of Affine Coordinates for Pairing Computation"],"prefix":"10.1007","author":[{"given":"Kristin","family":"Lauter","sequence":"first","affiliation":[]},{"given":"Peter L.","family":"Montgomery","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Naehrig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ar\u00e8ne, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster computation of the Tate pairing. Journal of Number Theory (2010), doi:10.1016\/j.jnt.2010.05.013","DOI":"10.1016\/j.jnt.2010.05.013"},{"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"},{"issue":"10","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1109\/TC.2004.83","volume":"53","author":"S. Baktir","year":"2004","unstructured":"Baktir, S., Sunar, B.: Optimal tower fields. IEEE Transactions on Computers\u00a053(10), 1231\u20131243 (2004)","journal-title":"IEEE Transactions on Computers"},{"key":"1_CR4","unstructured":"Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for key management - part 1: General (revised). Technical report, NIST National Institute of Standards and Technology. Published as NIST Special Publication 800-57 (2007), \n                      http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/documents\/SP800-57Part1_3-8-07.pdf"},{"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., \u00d3 h\u00c9igeartaigh, C., 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":"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)"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00145-004-0311-z","volume":"17","author":"P.S.L.M. Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. Journal of Cryptology\u00a017(4), 321\u2013334 (2004)","journal-title":"Journal of Cryptology"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-13797-6_13","volume-title":"Arithmetic of Finite Fields \u2013 WAIFI 2010","author":"N. Benger","year":"2010","unstructured":"Benger, N., Scott, M.: Constructing tower extensions of finite fields for implementation of pairing-based cryptography. In: Anwar Hasan, M., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol.\u00a06087, pp. 180\u2013195. Springer, Heidelberg (2010)"},{"key":"1_CR10","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database, \n                      http:\/\/www.hyperelliptic.org\/EFD"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Beuchat, J.-L., Gonz\u00e1lez D\u00edaz, J.E., Mitsunari, S., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F., Teruya, T.: High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves. IACR ePrint Archive, report 2010\/354 (2010), \n                      http:\/\/eprint.iacr.org\/2010\/354","DOI":"10.1007\/978-3-642-17455-1_2"},{"volume-title":"Advances in Elliptic Curve Cryptography","year":"2005","key":"1_CR12","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P. (eds.): Advances in Elliptic Curve Cryptography. Cambridge University Press, Cambridge (2005)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","year":"2005","key":"1_CR14","unstructured":"Cohen, H., Frey, G., Doche, C. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman and Hall\/CRC, Boca Raton (2005)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-03298-1_7","volume-title":"Pairing 2009","author":"C. Costello","year":"2009","unstructured":"Costello, C., Hisil, H., Boyd, C., Nieto, J.M.G., Wong, K.K.-H.: Faster pairings on special Weierstrass curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 89\u2013101. Springer, Heidelberg (2009)"},{"key":"1_CR16","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":"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_CR17","doi-asserted-by":"crossref","unstructured":"Doche, C.: Finite Field Arithmetic. In: [14], ch. 11, pp. 201\u2013237. CRC Press, Boca Raton (2005)","DOI":"10.1201\/9781420034981.ch11"},{"key":"1_CR18","first-page":"115","volume-title":"[14]","author":"S. Duquesne","year":"2005","unstructured":"Duquesne, S., Frey, G.: Background on Pairings. In: [14], ch. 6, pp. 115\u2013124. CRC Press, Boca Raton (2005)"},{"key":"1_CR19","first-page":"389","volume-title":"[14]","author":"S. Duquesne","year":"2005","unstructured":"Duquesne, S., Frey, G.: Implementation of Pairings. In: [14], ch. 16, pp. 389\u2013404. CRC Press, Boca Raton (2005)"},{"issue":"2","key":"1_CR20","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_CR21","first-page":"183","volume-title":"[12]","author":"S.D. Galbraith","year":"2005","unstructured":"Galbraith, S.D.: Pairings. In: [12], ch. IX, pp. 183\u2013213. Cambridge University Press, Cambridge (2005)"},{"key":"1_CR22","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":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-642-04159-4_3","volume-title":"SAC 2008","author":"P. Grabher","year":"2009","unstructured":"Grabher, P., Gro\u00dfsch\u00e4dl, J., Page, D.: On software parallel implementation of cryptographic pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 35\u201350. Springer, Heidelberg (2009)"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-13013-7_13","volume-title":"PKC 2010","author":"R. Granger","year":"2010","unstructured":"Granger, R., Scott, M.: Faster squaring in the cyclotomic group of sixth degree extensions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 209\u2013223. Springer, Heidelberg (2010)"},{"key":"1_CR25","unstructured":"Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive, Report 2006\/172 (2006), \n                      http:\/\/eprint.iacr.org\/2006\/172\/"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1013860532636","volume":"25","author":"J. Guajardo","year":"2001","unstructured":"Guajardo, J., Paar, C.: Itoh-Tsujii inversion in standard basis and its application in cryptography and codes. Designs, Codes and Cryptography\u00a025, 207\u2013216 (2001)","journal-title":"Designs, Codes and Cryptography"},{"key":"1_CR28","series-title":"Cryptology and Information Security Series","volume-title":"Identity-Based Cryptography","author":"D. Hankerson","year":"2008","unstructured":"Hankerson, D., Menezes, A.J., Scott, M.: Software implementation of pairings. In: Joye, M., Neven, G. (eds.) Identity-Based Cryptography. Cryptology and Information Security Series, vol.\u00a02. IOS Press, Amsterdam (2008)"},{"key":"1_CR29","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2003","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, New York (2003)"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. He\u00df","year":"2006","unstructured":"He\u00df, F., Smart, N.P., Vercauteren, F.: The eta pairing revisited. IEEE Transactions on Information Theory\u00a052, 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-89754-5_31","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"S. Ionica","year":"2008","unstructured":"Ionica, S., Joux, A.: Another approach to pairing computation in Edwards coordinates. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 400\u2013413. Springer, Heidelberg (2008)"},{"issue":"3","key":"1_CR32","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2\u02c6m) using normal bases. Inf. Comput.\u00a078(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"1_CR33","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":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-48910-X_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"T. Kobayashi","year":"1999","unstructured":"Kobayashi, T., Morita, H., Kobayashi, K., Hoshino, F.: Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 176\u2013189. Springer, Heidelberg (1999)"},{"issue":"4","key":"1_CR35","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"},{"issue":"4","key":"1_CR36","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil pairing and its efficient calculation. Journal of Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"issue":"177","key":"1_CR37","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048(177), 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"issue":"3","key":"1_CR38","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"P.L. Montgomery","year":"2005","unstructured":"Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers\u00a054(3), 362\u2013369 (2005)","journal-title":"IEEE Transactions on Computers"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-14712-8_7","volume-title":"Progress in Cryptology \u2013 Latincrypt 2010","author":"M. Naehrig","year":"2010","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings. In: Abdalla, M. (ed.) LATINCRYPT 2010. LNCS, vol.\u00a06212, pp. 109\u2013123. Springer, Heidelberg (2010), corrected version: \n                      http:\/\/www.cryptojedi.org\/papers\/dclxvi-20100714.pdf"},{"key":"1_CR40","unstructured":"Schroeppel, R., Beaver, C.: Accelerating elliptic curve calculations with the reciprocal sharing trick. In: Mathematics of Public-Key Cryptography (MPKC), University of Illinois at Chicago (2003)"},{"key":"1_CR41","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_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing 2009","author":"M. Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 78\u201388. Springer, Heidelberg (2009)"},{"key":"1_CR43","unstructured":"Smart, N. (ed.): ECRYPT II yearly report on algorithms and keysizes (2009-2010). Technical report, ECRYPT II \u2013 European Network of Excellence in Cryptology, EU FP7, ICT-2007-216676. Published as deliverable D.SPA.13 (2010), \n                      http:\/\/www.ecrypt.eu.org\/documents\/D.SPA.13.pdf"},{"issue":"1","key":"1_CR44","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 Transactions on Information Theory\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography - Pairing 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17455-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:25:20Z","timestamp":1676075120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-17455-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174544","9783642174551"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17455-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}