.png){kind=icon}
.png){kind=icon}
Return
Binary-Ternary Plus-Minus Modular Inversion in RNS
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2016.2529625.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fast RNS modular inversion for finite fields arithmetic has been published at CHES 2013 conference. It is based on the binary version of the plus-minus Euclidean algorithm. In the context of elliptic curve cryptography (i.e., 160550 bits finite fields), it significantly speeds-up modular inversions. In this paper, we propose an improved version based on both radix 2 and radix 3. This new algorithm leads to 30 percent speed-up for a maximal area overhead about 4 percent on Virtex 5 FPGAs.
Keywords:
Residue number system
modular arithmetic
extended Euclidean algorithm
ECC
FPGA
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K