.png){kind=icon}
.png){kind=icon}
Return
Efficient Word Size Modular Arithmetic
.png){kind=icon}
PRE
AI
DOI：10.1109/TETC.2021.3073475.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Modular multiplication is used in a wide range of applications. Most of the existing modular multiplication algorithms in the literature often focus on large size moduli. However, those large moduli oriented modular multiplication solutions are also used to implement modular arithmetic for applications requiring modular arithmetic on moduli of size inferior to a word size i.e., 32/64bits. As it happens, a large majority of applications are using word size modular arithmetic. In this work, we propose a new modular multiplication designed to be computed on one word size only. For word size moduli, in a large majority of instances, our solution outperforms other existing solutions including generalist solutions like Montgomery's and Barrett's modular multiplication as well as classes of moduli like Mersenne, Pseudo-Mersenne, Montgomery-Friendly and Generalized Mersenne.
Keywords:
Cryptography
Transforms
Redundancy
Lattices
Elliptic curve cryptography
System implementation
NIST
Modular arithmetic
modular multiplication
modular exponentiation
polynomial evaluation
number theoretical transform
residue number system
mixed radix system
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.4
Papers:
1.1K
Citations:
3.4K