@inproceedings{2000709,
author={Robert Granger and  Florian Hess and  Roger Oyono and  Nicolas Theriault and Fre Vercauteren},
title={Ate Pairing on Hyperelliptic Curves},
booktitle={Advances in Cryptology - EUROCRYPT 2007},
publisher={Springer, LNCS 4515},
pages={430--447},
month={May},
year={2007},
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 also automatically reduced, i.e., no final exponentiation is needed.},
abstract-url={http://www.cs.bris.ac.uk/Publications/pub_master.jsp?id=2000709},
keyword={Computational Number Theory,Cryptography},
pubtype={102}
}