University of Surrey

Test tubes in the lab Research in the ATI Dance Research

High Security Pairing-Based Cryptography Revisited

Granger, Robert, Page, D. and Smart, N. P. (2006) High Security Pairing-Based Cryptography Revisited In: the 7th International Algorithmic Number Theory Symposium (ANTS-VII), 23-28 Jul 2006, Berlin, Germany.

Full text not available from this repository.


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.

Item Type: Conference or Workshop Item (Conference Paper)
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
Page, D.
Smart, N. P.
Date : 23 July 2006
DOI : 10.1007/11792086_34
Copyright Disclaimer : © Springer-Verlag Berlin Heidelberg 2006
Uncontrolled Keywords : Elliptic Curve; Elliptic Curf; Security Level; Operation Count; High Security Level
Depositing User : Clive Harris
Date Deposited : 08 Feb 2019 08:27
Last Modified : 08 Feb 2019 08:27

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800