Sciweavers

13 search results - page 1 / 3
» Very High Radix Scalable Montgomery Multipliers
Sort
View
IWSOC
2005
IEEE
131views Hardware» more  IWSOC 2005»
13 years 10 months ago
Very High Radix Scalable Montgomery Multipliers
This paper describes a very high radix scalable Montgomery multiplier. It extends the radix-2 Tenca-Koç scalable architecture using w × v – bit integer multipliers in place of...
Kyle Kelley, David Harris
CHES
2001
Springer
124views Cryptology» more  CHES 2001»
13 years 9 months ago
High-Radix Design of a Scalable Modular Multiplier
This paper describes an algorithm and architecture based on an extension of a scalable radix-2 architecture proposed in a previous work. The algorithm is proven to be correct and t...
Alexandre F. Tenca, Georgi Todorov, Çetin K...
ICCD
2004
IEEE
138views Hardware» more  ICCD 2004»
14 years 1 months ago
Design and Implementation of Scalable Low-Power Montgomery Multiplier
In this paper, an efficient Montgomery multiplier is introduced for the modular exponentiation operation, which is fundamental to numerous public-key cryptosystems. Four aspects a...
Hee-Kwan Son, Sang-Geun Oh
ARITH
2005
IEEE
13 years 10 months ago
An Improved Unified Scalable Radix-2 Montgomery Multiplier
This paper describes an improved version of the Tenca-Koç unified scalable radix-2 Montgomery multiplier with half the latency for small and moderate precision operands and half ...
David Harris, Ram Krishnamurthy, Mark Anders, Sanu...
ISCAS
2007
IEEE
176views Hardware» more  ISCAS 2007»
13 years 10 months ago
SPA against an FPGA-Based RSA Implementation with a High-Radix Montgomery Multiplier
— 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...
Atsushi Miyamoto, Naofumi Homma, Takafumi Aoki, Ak...