Elliptic Curves, Group Law, and Efficient Computation

Speaker  Ed Dawson

Host  Josh Benaloh

Affiliation  Queensland University of Technology

Duration  00:41:33

Date recorded  2 August 2010

I will demonstrate techniques to derive the addition law on an arbitrary elliptic curve. The derived addition laws are applied to provide methods for efficiently adding points. The contributions immediately find applications in cryptology such as the efficiency improvements for elliptic curve scalar multiplication and cryptographic pairing computations. In particular, contributions are made to case of the following five forms of elliptic curves:

  1. Short Weierstrass form, y2 = x3 + ax + b,
  2. Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1,
  3. Twisted Hessian form, ax3 + y3 + 1 = dxy,
  4. Twisted Edwards form, ax2 + y2 = 1 + dx2y2,
  5. Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1.

These forms are the most promising candidates for efficient computations and thus considered in this talk. Nevertheless, the employed methods are capable of handling arbitrary elliptic curves.

©2010 Microsoft Corporation. All rights reserved.
> Elliptic Curves, Group Law, and Efficient Computation