International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Multi-Dimensional Montgomery Ladders for Elliptic Curves

Authors:
Daniel R. L. Brown
Download:
URL: http://eprint.iacr.org/2006/220
Search ePrint
Search Google
Abstract: Montgomery's ladder algorithm for elliptic curve scalar multiplication uses only the x-coordinates of points. Avoiding calculation of the y-coordinates saves time for certain curves. Montgomery introduced his method to accelerate Lenstra's elliptic curve method for integer factoring. Bernstein extended Montgomery's ladder algorithm by computing integer combinations of two points, thus accelerating signature verification over certain curves. This paper modifies and extends Bernstein's algorithm to integer combinations of two or more points.
BibTeX
@misc{eprint-2006-21713,
  title={Multi-Dimensional Montgomery Ladders for Elliptic Curves},
  booktitle={IACR Eprint archive},
  keywords={implementation / ECC Montgomery ladder},
  url={http://eprint.iacr.org/2006/220},
  note={ dbrown@certicom.com 13329 received 29 Jun 2006, last revised 30 Jun 2006},
  author={Daniel R. L. Brown},
  year=2006
}