CryptoDB
Simplified pairing computation and security implications
Authors: | |
---|---|
Download: | |
Abstract: | Recent progress on pairing implementation has made certain pairings extremely simple and fast to compute. Hence, it is natural to examine if there are consequences for the security of pairing-based cryptography. This paper gives a method to compute eta pairings in a way which avoids the requirement for a final exponentiation. The method does not lead to any improvement in the speed of pairing implementation. However, it seems appropriate to re-evaluate the security of pairing based cryptography in light of these new ideas. A multivariate attack on the pairing inversion problem is proposed and analysed. Our findings support the belief that pairing inversion is a hard computational problem. |
BibTeX
@misc{eprint-2006-21662, title={Simplified pairing computation and security implications}, booktitle={IACR Eprint archive}, keywords={foundations / pairings}, url={http://eprint.iacr.org/2006/169}, note={ coheig@gmail.com 13283 received 15 May 2006}, author={Steven D. Galbraith and Colm O hEigeartaigh and Caroline Sheedy}, year=2006 }