Loading...
conference paper
High Security Pairing-Based Cryptography Revisited
2006
Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006. Proceedings
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.
Type
conference paper
Authors
Editors
Hess, Florian
•
Pauli, Sebastian
•
Pohst, Michael
Publication date
2006
Publisher
Published in
Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006. Proceedings
Series title/Series vol.
Lecture Notes in Computer Science; 4076
Start page
480
End page
494
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Berlin, Germany | July 23-28, 2006 | |
Available on Infoscience
January 19, 2016
Use this identifier to reference this record