Montgomery curves and the Montgomery ladder

D.J. Bernstein; T. Lange

Montgomery curves and the Montgomery ladder

D.J. Bernstein, T. Lange

Onderzoeksoutput: Boek/rapport › Rapport › Academic

208 Downloads (Pure)

Samenvatting

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.

Originele taal-2	Engels
Plaats van productie	s.l.
Uitgeverij	IACR
Aantal pagina's	43
Status	Gepubliceerd - 2017

Publicatie series

Naam	Cryptology ePrint Archive
Volume	2017/293

Toegang tot document

publishers versionDefinitieve gepubliceerde versie, 207 KB

http://eprint.iacr.org/2017/293

1 Hoofdstuk

Montgomery curves and the Montgomery ladder
Bernstein, D. J. & Lange, T., 2017, Topics in Computational Number Theory Inspired by Peter L. Montgomery. Bos, J. W. ,. & Lenstra, A. K. (uitgave). Cambridge: Cambridge University Press, blz. 82-115
Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Hoofdstuk › Academic › peer review

Open Access
Bestand

Citeer dit

@book{6e2e210000014bd79f1a32a894e81a08,

title = "Montgomery curves and the Montgomery ladder",

abstract = "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. ",

author = "D.J. Bernstein and T. Lange",

year = "2017",

language = "English",

series = "Cryptology ePrint Archive",

publisher = "IACR",

}

TY - BOOK

T1 - Montgomery curves and the Montgomery ladder

AU - Bernstein, D.J.

AU - Lange, T.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

M3 - Report

T3 - Cryptology ePrint Archive

BT - Montgomery curves and the Montgomery ladder

PB - IACR

CY - s.l.

ER -

Montgomery curves and the Montgomery ladder

Samenvatting

Publicatie series

Toegang tot document

Vingerafdruk

Onderzoekersoutput

Montgomery curves and the Montgomery ladder

Citeer dit