Sciweavers

286 search results - page 3 / 58
» Efficient Hardware Architectures for Modular Multiplication ...
Sort
View
RECONFIG
2008
IEEE
268views VLSI» more  RECONFIG 2008»
14 years 4 days ago
Parametric, Secure and Compact Implementation of RSA on FPGA
1 We present a fast, efficient, and parameterized modular multiplier and a secure exponentiation circuit especially intended for FPGAs on the low end of the price range. The desig...
Ersin Oksuzoglu, Erkay Savas
EUROCRYPT
2000
Springer
13 years 9 months ago
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
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...
Shin-ichi Kawamura, Masanobu Koike, Fumihiko Sano,...
TC
2010
13 years 14 days ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
FCCM
2005
IEEE
89views VLSI» more  FCCM 2005»
13 years 11 months ago
A General Purpose, Highly Efficient Communication Controller Architecture for Hardware Acceleration Platforms
Although researchers have presented individual techniques to efficiently utilize the Peripheral Component Interconnect (PCI) bus, their contributions fail to provide a direct path...
Petersen F. Curt, James P. Durbano, Fernando E. Or...
CHES
2001
Springer
191views Cryptology» more  CHES 2001»
13 years 10 months ago
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
Abstract. This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF(p). This is a scalable arch...
Gerardo Orlando, Christof Paar