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.
Type de document :
Article dans une revue
Journal of Cryptographic Engineering, Springer, 2017, Special issue on Montgomery arithmetic, <10.1007/s13389-017-0157-6>
Liste complète des métadonnées


https://hal.inria.fr/hal-01483768
Contributeur : Benjamin Smith <>
Soumis le : lundi 6 mars 2017 - 14:20:50
Dernière modification le : mercredi 12 juillet 2017 - 15:04:00
Document(s) archivé(s) le : mercredi 7 juin 2017 - 13:51:22

Fichiers

Monty_arxiv.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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>

Partager

Métriques

Consultations de
la notice

419

Téléchargements du document

80