首页|EFFICIENT ARITHMETIC IN (PSEUDO-)MERSENNE PRIME ORDER FIELDS
EFFICIENT ARITHMETIC IN (PSEUDO-)MERSENNE PRIME ORDER FIELDS
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Amer Inst Mathematical Sciences-Aims
Elliptic curve cryptography is based upon elliptic curves defined over finite fields. Operations over such elliptic curves require arithmetic over the underlying field. In particular, fast implementations of multiplication and squaring over the finite field are required for performing efficient elliptic curve cryptography. The present work considers the problem of obtaining efficient algorithms for field multiplication and squaring. From a theoretical point of view, we present a number of algorithms for multiplication/squaring and reduction which are appropriate for different settings. Our algorithms collect together and generalize ideas which are scattered across various papers and codes. At the same time, we also introduce new ideas to improve upon existing works. A key theoretical feature of our work is that we provide formal statements and detailed proofs of correctness of the different reduction algorithms that we describe. On the implementation aspect, a total of fourteen primes are considered, covering all previously proposed cryptographically relevant (pseudo-)Mersenne prime order fields at various security levels. For each of these fields, we provide 64-bit assembly implementations of the relevant multiplication and squaring algorithms targeted towards two different modern Intel architectures. We were able to find previous 64-bit implementations for six of the fourteen primes considered in this work. On the Haswell and Skylake processors of Intel, for all the six primes where previous implementations are available, our implementations outperform such previous implementations.
Field multiplicationsquaringreductioninversionMersenne primespseudo-Mersenne primesconstant-time computationFermat's little theoremelliptic curve cryp-tographyscalar multiplicationCRYPTOGRAPHYCURVE25519
NSTL
Amer Inst Mathematical Sciences-Aims
