{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:43:26Z","timestamp":1774946606080,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540681595","type":"print"},{"value":"9783540681649","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68164-9_25","type":"book-chapter","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T10:48:34Z","timestamp":1212144514000},"page":"371-388","source":"Crossref","is-referenced-by-count":22,"title":["On Compressible Pairings and Their Computation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Naehrig","sequence":"first","affiliation":[]},{"given":"Paulo S. L. M.","family":"Barreto","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Schwabe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","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., O\u2019hEigeartaigh, 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":"25_CR2","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":"25_CR3","unstructured":"Devegili, A.J., O\u2019hEigeartaigh, C., Scott, M., Dahab, R.: Multiplication and squaring on pairing-friendly fields. Cryptology ePrint Archive, Report 2006\/471(2006), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"25_CR4","unstructured":"Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over barreto-naehrig curves. Cryptology ePrint Archive, Report,2007\/390 (2007), \n                    \n                      http:\/\/eprint.iacr.org\/2007\/390"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1201\/9781420034981.ch11","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"C. Doche","year":"2005","unstructured":"Doche, C.: Finite field arithmetic. In: Cohen, H., Frey, G. (eds.) Handbook of Elliptic and Hyperelliptic Curve Cryptography, ch.\u00a011, pp. 201\u2013238. CRC Press, Boca Raton (2005)"},{"key":"25_CR6","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Cryptology ePrint Archive, Report, 2006\/372 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/2006\/372"},{"key":"25_CR7","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.: On small characteristic algebraic tori in pairing based cryptography. LMS Journal of Computation and Mathematics\u00a09, 64\u201385 (2006)","journal-title":"LMS Journal of Computation and Mathematics"},{"issue":"10","key":"25_CR8","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., Vercauteren, F.: The eta pairing revisited. IEEE Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR9","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing brezing-weng pairing friendly elliptic curves using elements in the cyclotomic field. Cryptology ePrint Archive, Report, 2007\/452 (2007), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"25_CR10","unstructured":"Lee, E., Lee, H., Park, C.: Efficient and generalized pairing computation on abelian varieties. Cryptology ePrint Archive, Report 2008\/040 (2008), \n                    \n                      http:\/\/eprint.iacr.org\/\n                    \n                    \n                  ."},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-77272-9_18","volume-title":"Cryptography and Coding","author":"S. Matsuda","year":"2007","unstructured":"Matsuda, S., Kanayama, N., Hess, F., Okamoto, E.: Optimised versions of the ate and twisted ate pairings. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol.\u00a04887, pp. 302\u2013312. Springer, Heidelberg (2007)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/978-3-540-45146-4_21","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"K. Rubin","year":"2003","unstructured":"Rubin, K., Silverberg, A.: Torus-based cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 349\u2013365. Springer, Heidelberg (2003)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-28628-8_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Scott","year":"2004","unstructured":"Scott, M., Barreto, P.S.L.M.: Compressed pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 140\u2013156. Springer, Heidelberg (2004)"},{"key":"25_CR14","unstructured":"Vercauteren, F.: Optimal pairings. Cryptology ePrint Archive, Report 2008\/096 (2008), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"25_CR15","unstructured":"Zhao, C., Zhang, F., Huang, J.: A note on the ate pairing. Cryptology ePrint Archive, Report 2007\/247 (2007), \n                    \n                      http:\/\/eprint.iacr.org\/2007\/247"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68164-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:38:56Z","timestamp":1620016736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68164-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681595","9783540681649"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68164-9_25","relation":{},"subject":[]}}