University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Ate Pairing on Hyperelliptic Curves

Granger, R., Hess, F., Oyono, R., Thériault, N. and Vercauteren, F. (2007) Ate Pairing on Hyperelliptic Curves In: The 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques - Advances in Cryptology (EUROCRYPT 2007), 20-24 May 2007, Barcelona, Spain.

Full text not available from this repository.

Abstract

In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has the following surprising properties: The loop length in Miller’s algorithm can be up to g times shorter than for the Tate pairing, with g the genus of the curve, and the pairing is automatically reduced, i.e. no final exponentiation is needed.

Item Type: Conference or Workshop Item (Conference Paper)
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
NameEmailORCID
Granger, R.r.granger@surrey.ac.uk
Hess, F.
Oyono, R.
Thériault, N.
Vercauteren, F.
Date : 20 May 2007
DOI : 10.1007/978-3-540-72540-4_25
Copyright Disclaimer : © Springer-Verlag Berlin Heidelberg 2007
Uncontrolled Keywords : Tate pairing; Ate pairing; Hyperelliptic curves; Finite fields
Depositing User : Clive Harris
Date Deposited : 07 Feb 2019 16:26
Last Modified : 07 Feb 2019 16:26
URI: http://epubs.surrey.ac.uk/id/eprint/850405

Actions (login required)

View Item View Item

Downloads

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