.png){kind=icon}
.png){kind=icon}
Return
An RNS Montgomery modular multiplication algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/12.709376.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to mixed radix, and is performed using a Residue Number System. By choosing the moduli of the RNS system reasonably large and implementing the system on a ring of fairly simple processors, an effect corresponding to a redundant high-radix implementation is achieved. The algorithm can be implemented to run in O(n) time on O(n) processors. where n is the number of moduli in the RNS system, and the unit of time is a simple residue operation, possibly by table look-up. Two different implementations are proposed, one based on processors attached to a broadcast bus, another on an oriented ring structure.
Keywords:
computer arithmetic
residue number system
modular multiplication
cryptography
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available