Efficient algorithms for pairing-based cryptosystems：（高效的双线性密码算法）.pdfVIP

Efficient Algorithms for Pairing-Based Cryptosystems 1 1 2 3 Paulo S.L.M. Barreto , Hae Y. Kim , Ben Lynn , and Michael Scott 1 Universidade de S˜ao Paulo, Escola Polit´ecnica Av. Prof. Luciano Gualberto, tr. 3, 158 BR 05508-900, S˜ao Paulo(SP), Brazil pbarreto@larc.usp.br, hae@lps.usp.br 2 Computer Science Department, Stanford University, USA blynn@ 3 School of Computer Applications Dublin City University Ballymun, Dublin 9, Ireland mscott@indigo.ie Abstract. We describe fast new algorithms to implement recent crypto- systems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in larger characteristics. We also propose faster algorithms for scalar multiplication in characteristic 3 and square root extraction over Fpm , the latter technique being also useful in contexts other than that of pairing-based cryptography. 1 Introduction The recent discovery [11] of groups where the Decision Diffie-Hellman (DDH) problem is easy while the Computational Diffie-Hellman (CDH) problem is hard, and the subsequent definition of a new class of problems variously called the Gap Diffie-Hellman [11], Bilinear Diffie-Hellman [2], or Tate-Diffie-Hellman [6] class, has given rise to the development of a new, ever expanding family of cryptosystems based on