46 search results - page 1 / 10 » Cox-Rower Architecture for Fast Parallel Montgomery Multipli... |
102
Voted
EUROCRYPT
2000
Springer
15 years 1 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...
71
Voted
DATE
2010
IEEE
2010
IEEE
pSHS: A scalable parallel software implementation of Montgomery multiplication for multicore systems
15 years 3 months ago
—Parallel programming techniques have become one of the great challenges in the transition from single-core to multicore architectures. In this paper, we investigate the parallel...
59
Voted
CHES
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. This paper describes the methodology and design of a scalable Montgomery multiplication module. There is no limitation on the maximum number of bits manipulated by the mu...
102
Voted
IPPS
2003
IEEE
15 years 3 months 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...
85
Voted
COMSWARE
2007
IEEE
15 years 4 months ago
2007
IEEE
The Elliptic Curve Digital Signature Algorithm admits a natural parallelization wherein the point multiplication step can be split in two parts and executed in parallel. Further pa...