[Resource Topic] 2017/293: Montgomery curves and the Montgomery ladder

Welcome to the resource topic for 2017/293

Montgomery curves and the Montgomery ladder

Authors: Daniel J. Bernstein, Tanja Lange


The Montgomery ladder is a remarkably simple method of computing scalar multiples of points on a broad class of elliptic curves. This article surveys a wide range of topics related to the Montgomery ladder, both from the historical perspective of Weierstrass curves and from the modern perspective of Edwards curves. New material includes a full proof of a complete constant-time ladder algorithm suitable for cryptographic applications.

ePrint: https://eprint.iacr.org/2017/293

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .