Sciweavers

21 search results - page 1 / 5
» Implementation of RSA Based on Modified Montgomery Modular M...
Sort
View
CSC
2006
13 years 6 months ago
Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm
- A modified Montgomery modular multiplication algorithm using four-to-two CSA (carry save adder) was proposed. The modified algorithm avoids the carry delay and the repeated outpu...
Gang Feng, Guang-Sheng Ma, Zhi Yang
DELTA
2006
IEEE
13 years 8 months ago
Modified Montgomery Modular Multiplication Using 4: 2 Compressor and CSA Adder
The efficiency of the Public Key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication scheme. In this paper, Modified Montgomery multip...
Himanshu Thapliyal, Anvesh Ramasahayam, Vivek Redd...
TC
2010
12 years 11 months 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...
DATE
2003
IEEE
87views Hardware» more  DATE 2003»
13 years 10 months ago
FPGA-Based Implementation of a Serial RSA Processor
In this paper we present an hardware implementation of the RSA algorithm for public-key cryptography. The RSA algorithm consists in the computation of modular exponentials on larg...
Antonino Mazzeo, Luigi Romano, Giacinto Paolo Sagg...
IPPS
2003
IEEE
13 years 10 months ago
Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array
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...
Siddika Berna Örs, Lejla Batina, Bart Preneel...