On compressible pairings and their computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5023 LNCS, Issue , 2008, Pages 371-388

  Naehrig, Michael ^a   Barreto, Paulo S L M ^b   Schwabe, Peter ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Algebraictori; Ate pairing; Compressible pairings; Eta pairing; Pairing based cryptography; Tate pairing; Twists

Indexed keywords

ALUMINUM; CRYPTOGRAPHY; MICROFLUIDICS;

APPLIED (CO); BILINEAR PAIRINGS; COMPUTATION METHODS; COMPUTATION SPEEDS; CRYPTOLOGY; FINITE FIELDS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; MEMORY REQUIREMENTS; NEW METHODS; PERFORMANCE EVALUATION (PE); SPRINGER (CO); TRADING OFF;

COMPUTATIONAL METHODS;

EID: 45449092547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68164-9_25     Document Type: Conference Paper

References (15)

1. Barreto, P.S.L.M., Galbraith, S.D., O'hEigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42(3), 239-271 (2007)
2. Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319-331. Springer, Heidelberg (2006)
3. Devegili, A.J., O'hEigeartaigh, C., Scott, M., Dahab, R.: Multiplication and squaring on pairing-friendly fields. Cryptology ePrint Archive, Report 2006/471(2006), http://eprint.iacr.org/
4. Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over barreto-naehrig curves. Cryptology ePrint Archive, Report,2007/390 (2007), http://eprint.iacr.org/2007/390
5. Doche, C.: Finite field arithmetic. In: Cohen, H., Frey, G. (eds.) Handbook of Elliptic and Hyperelliptic Curve Cryptography, ch. 11, pp. 201-238. CRC Press, Boca Raton (2005)
6. Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Cryptology ePrint Archive, Report, 2006/372 (2006), http://eprint. iacr.org/2006/372
7. Granger, R., Page, D., Stam, M.: On small characteristic algebraic tori in pairing based cryptography. LMS Journal of Computation and Mathematics 9, 64-85 (2006)
8. Hess, F., Smart, N., Vercauteren, F.: The eta pairing revisited. IEEE Transactions on Information Theory 52(10), 4595-4602 (2006)
9. 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), http://eprint.iacr.org/
10. Lee, E., Lee, H., Park, C.: Efficient and generalized pairing computation on abelian varieties. Cryptology ePrint Archive, Report 2008/040 (2008), http://eprint. iacr.org/.
11. 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. 4887, pp. 302-312. Springer, Heidelberg (2007)
12. Rubin, K., Silverberg, A.: Torus-based cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 349-365. Springer, Heidelberg (2003)
13. Scott, M., Barreto, P.S.L.M.: Compressed pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 140-156. Springer, Heidelberg (2004)
14. Vercauteren, F.: Optimal pairings. Cryptology ePrint Archive, Report 2008/096 (2008), http://eprint.iacr.org/
15. Zhao, C., Zhang, F., Huang, J.: A note on the ate pairing. Cryptology ePrint Archive, Report 2007/247 (2007), http://eprint.iacr.org/2007/247