Constructing tower extensions of finite fields for implementation of pairing-based cryptography

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

Volumn 6087 LNCS, Issue , 2010, Pages 180-195

  Benger, Naomi ^a   Scott, Michael ^a  

^a DUBLIN CITY UNIVERSITY   (Ireland)

Author keywords

Euler's conjectures; Extension fields; Pairing implementation; Pairing based cryptosystems

Indexed keywords

ELLIPTIC CURVE; EULER'S CONJECTURES; EXTENSION FIELD; FINITE EXTENSION; FINITE FIELDS; IRREDUCIBLE POLYNOMIALS; PAIRING IMPLEMENTATION; PAIRING-BASED CRYPTOGRAPHY; PAIRING-BASED CRYPTOSYSTEMS;

CRYPTOGRAPHY; LARGE SCALE SYSTEMS; TOWERS;

FINITE ELEMENT METHOD;

EID: 79956294037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13797-6_13     Document Type: Conference Paper

References (23)

1. IEEE P1363.3: Standard for identity-based cryptographic techniques using pairings. Draft 3: Section 5.3.2, http://grouper.ieee.org/groups/1363/IBC/index. html
2. Arène, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster computation of the Tate pairing. Cryptology ePrint Archive, Report 2009/155 (2009), http://eprint.iacr.org/
3. Bailey, D., Paar, C.: Optimal extension fields for fast arithmetic in public-key algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 472-485. Springer, Heidelberg (1998) (Pubitemid 128119025)
4. 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. 2442, pp. 354-368. Springer, Heidelberg (2002)
5. Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 263-273. Springer, Heidelberg (2003)
6. 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) (Pubitemid 43986803)
7. Cohen, H., Frey, G. (eds.): Handbook of elliptic and hyperelliptic curve cryptography. CRC Press, Boca Raton (2005)
8. Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over Barreto-Naehrig curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 197-207. Springer, Heidelberg (2007)
9. Dominguez Perez, L.J., Scott, M.: Automatic generation of optimised cryptographic pairing functions. In: SPEED-CC Workshop Record- Software Performance Enhancement for Encryption and Decryption and Cryptographic Compilers, vol. 1, pp. 55-71 (2009)
10. Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Journal of Cryptology 23 (2010)
11. Galbraith, S., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 518-535. Springer, Heidelberg (2010)
12. 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)
13. Hess, F., Smart, N., Vercauteren, F.: The eta pairing revisited. IEEE Trans. Information Theory 52, 4595-4602 (2006) (Pubitemid 46445294)
14. Kachisa, E., Schaefer, E., Scott, M.: Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126-135. Springer, Heidelberg (2008)
15. Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13-36. Springer, Heidelberg (2005) (Pubitemid 43778715)
16. Lee, E., Lee, H., Park, C.: Efficient and generalized pairing computation on abelian varieties. IEEE Trans. Information Theory 55, 1793-1803 (2009)
17. Lemmermeyer, F.: Reciprocity Laws: From Euler to Eisenstein. Springer Monographs in Mathematics. Springer, Heidelberg (2000)
18. Lidl, R., Niederreiter, H.: Finite Fields, 2nd edn. Encyclopedia of Mathematics and its Applications, vol. 20. Cambridge University Press, Cambridge (1997)
19. Baktir, S., Sunar, B.: Optimal tower fields. IEEE Transactions on Computers 53(10), 1231-1243 (2004) (Pubitemid 40108151)
20. Scott, M.: A note on twists for pairing friendly curves, ftp://ftp.computing.dcu.ie/pub/resources/crypto/twists.pdf
21. Scott, M., Barreto, P.: Compressed pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 140-156. Springer, Heidelberg (2004), http://eprint.iacr.org/2004/032/
22. Shirase, M.: Universally constructing 12-th degree extension field for ate pairing. Cryptology ePrint Archive, Report 2009/623 (2009), http://eprint.iacr.org/
23. Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, vol. 106. Springer, New York (1986)