Paper 2006/059

High Security Pairing-Based Cryptography Revisited

R. Granger, D. Page, and N. P. Smart

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 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.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
pairings
Contact author(s)
nigel @ cs bris ac uk
History
2006-02-16: revised
2006-02-15: received
See all versions
Short URL
https://ia.cr/2006/059
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/059,
      author = {R.  Granger and D.  Page and N. P.  Smart},
      title = {High Security Pairing-Based Cryptography Revisited},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/059},
      year = {2006},
      url = {https://eprint.iacr.org/2006/059}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.