90 search results - page 1 / 18 » Modular Multiplication and Base Extensions in Residue Number... |
ARITH
2001
IEEE
13 years 11 months ago
2001
IEEE
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by ap...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Distributed applications typically interact with a number of heterogeneous and autonomous components that evolve independently. Methodical development of such applications can ben...
IPPS
2003
IEEE
14 years 27 days ago
2003
IEEE
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...