High Security Pairing-Based Cryptography Revisited

  • R. Granger
  • D. Page
  • N. P. Smart
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4076)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • R. Granger
    • 1
  • D. Page
    • 1
  • N. P. Smart
    • 1
  1. 1.Dept. Computer ScienceUniversity of BristolBristolUK

Personalised recommendations