Montgomery curves and their arithmetic: The case of large characteristic fields

Abstract : Three decades ago, Montgomery introduced a new elliptic curve model for use in Lenstra's ECM factorization algorithm. Since then, his curves and the algorithms associated with them have become foundational in the implementation of elliptic curve cryptosystems. This article surveys the theory and cryptographic applications of Montgomery curves over non-binary finite fields, including Montgomery's x-only arithmetic and Ladder algorithm, x-only Diffie–Hellman, y-coordinate recovery, and 2-dimensional and Euclidean differential addition chains such as Montgomery's PRAC algorithm.
Complete list of metadatas

Cited literature [44 references]  Display  Hide  Download

https://hal.inria.fr/hal-01483768
Contributor : Benjamin Smith <>
Submitted on : Monday, March 6, 2017 - 2:20:50 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM
Long-term archiving on : Wednesday, June 7, 2017 - 1:51:22 PM

Files

Monty_arxiv.pdf
Files produced by the author(s)

Identifiers

Citation

Craig Costello, Benjamin Smith. Montgomery curves and their arithmetic: The case of large characteristic fields. Journal of Cryptographic Engineering, Springer, 2017, Special issue on Montgomery arithmetic, ⟨10.1007/s13389-017-0157-6⟩. ⟨hal-01483768⟩

Share

Metrics

Record views

853

Files downloads

489