Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CSC
2006

favoriteEmaildiscussreport

216views Applied Computing» more CSC 2006»

Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm

13 years 6 months ago

Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm

Download ww1.ucmss.com

- 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 output/input format conversions. We use this modified algorithm to design the RSA processing unit with 512-bit and 1024-bit key size .The resulting RSA units have a high throughput.

Gang Feng, Guang-Sheng Ma, Zhi Yang

Real-time Traffic

Carry Save Adder | CSC 2006 | CSC 2007 | Modified Algorithm | Modular Multiplication Algorithm |

claim paper

Related Content

» Modified Montgomery Modular Multiplication Using 4 2 Compressor and CSA Adder

» Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Method...

» FPGABased Implementation of a Serial RSA Processor

» Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array

» Efficient pipelining for modular multiplication architectures in prime fields

» Parametric Secure and Compact Implementation of RSA on FPGA

» CoxRower Architecture for Fast Parallel Montgomery Multiplication

» Fast Modular Reduction

» FPGAbased Design of a Large Moduli Multiplier for Public Key Cryptographic Systems

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	CSC
Authors	Gang Feng, Guang-Sheng Ma, Zhi Yang

Comments (0)