Cryptology ePrint Archive: Report 2020/665

Montgomery-friendly primes and applications to cryptography

Jean Claude Bajard and Sylvain Duquesne

Abstract: This paper deals with Montgomery-friendly primes designed for the modular reduction algorithm of Montgomery. These numbers are scattered in the literature and their properties are partially exploited. We exhibit a large family of Montgomery-friendly primes which give rise to efficient modular reduction algorithms. We develop two main uses. The first one is dedicated directly to cryptography, in particular for isogeny based approaches and more generally to Elliptic Curves Cryptography. We suggest more appropriate finite fields and curves in terms of complexity for the recommended security levels, for both isogeny-based cryptography and ECC. The second use is purely arithmetic, and we propose families of alternative RNS bases. We show that, for dedicated architectures with word operators, we can reach, for a same or better complexity, larger RNS bases with Montgomery-friendly pairwise co-primes than the RNS bases generally used in the literature with Pseudo-Mersenne numbers. This is particularly interesting for modular arithmetic used in cryptography.

Category / Keywords: implementation / Montgomery-friendly prime, Isogeny, ECC, RNS

Date: received 3 Jun 2020

Contact author: jean-claude bajard at sorbonne-universite fr

Available format(s): PDF | BibTeX Citation

Version: 20200605:195006 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]