Welcome to the resource topic for 2006/169
Title:
Simplified pairing computation and security implications
Authors: Steven D. Galbraith, Colm O hEigeartaigh, Caroline Sheedy
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.
ePrint: https://eprint.iacr.org/2006/169
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .