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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Granger, R., Page, D., & Smart, N. P. (2006). High security pairing-based cryptography revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4076 LNCS, pp. 480–494). Springer Verlag. https://doi.org/10.1007/11792086_34
Mendeley helps you to discover research relevant for your work.