High Security Pairing-Based Cryptography Revisited (2006)
| Venue: | In Algorithmic Number Theory Symposium – ANTS VII, Springer-Verlag LNCS XXXX, XXXX–XXXX |
| Citations: | 24 - 5 self |
BibTeX
@INPROCEEDINGS{Granger06highsecurity,
author = {R. Granger and D. Page and N. P. Smart},
title = {High Security Pairing-Based Cryptography Revisited},
booktitle = {In Algorithmic Number Theory Symposium – ANTS VII, Springer-Verlag LNCS XXXX, XXXX–XXXX},
year = {2006},
pages = {480--494},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 e#cient than the Weil pairing for all such security levels. This is achieved by using e#cient exponentiation techniques in the cyclotomic subgroup backed by e#cient squaring routines within the same subgroup.
