Paper 2006/220 Original: eprint.iacr.org/2006/220 ↗
Multi-Dimensional Montgomery Ladders for Elliptic Curves
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2006-06-30: last updated
- 2006-06-30: published
- Short URL
- https://ia.cr/2006/220
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/220,
author = {Daniel R. L. Brown},
title = {Multi-Dimensional Montgomery Ladders for Elliptic Curves},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/220},
year = {2006},
url = {https://eprint.iacr.org/2006/220}
}