High Security Pairing-Based Cryptography Revisited

The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We re-examine how one should implement pairings over ordinary elliptic curves for various practical levels of security. We conclude, contrary to prior work, that the Tate pairing is more efficient than the Weil pairing for all such security levels. This is achieved by using efficient exponentiation techniques in the cyclotomic subgroup backed by efficient squaring routines within the same subgroup.


Editor(s):
Hess, Florian
Pauli, Sebastian
Pohst, Michael
Published in:
Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006. Proceedings, 480-494
Presented at:
Algorithmic Number Theory, Berlin, Germany, July 23-28, 2006
Year:
2006
Publisher:
Springer Berlin Heidelberg
Laboratories:




 Record created 2016-01-19, last modified 2018-09-13

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)