This paper extends and generalizes Huff's model. It presents fast explicit formulas for point addition and doubling on Huff curves. It also addresses the problem of the efficient evaluation of pairings over Huff curves. Remarkably, the formulas we obtain feature some useful properties, including completeness and independence of the curve parameters.
Category / Keywords: public-key cryptography / Elliptic curves, Huff's model, unified addition law, complete addition law, explicit formulas, scalar multiplication, Tate pairing, Miller algorithm Date: received 6 Jul 2010 Contact author: mehdi tibouchi at normalesup org Available formats: PDF | BibTeX Citation Version: 20100707:013131 (All versions of this report) Discussion forum: Show discussion | Start new discussion