27 search results - page 1 / 6 » High-radix modular multiplication for cryptosystems |
ISCAS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Simple Power Analysis (SPA) was applied to an RSA processor with a high-radix Montgomery multiplier on an FPGA platform, and the different characteristics of power waveforms ca...
TC
2010
12 years 12 months ago
2010
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
IOLTS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we present an efficient design technique for implementing the Elliptic Curve Cryptographic (ECC) Scheme in FPGAs. Our technique is based on a novel and efficient i...
FPL
2005
Springer
13 years 10 months ago
2005
Springer
The computational fundament of most public-key cryptosystems is the modular multiplication. Improving the efficiency of the modular multiplication is directly associated with the...
WAIFI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks o...