An efficient CSA architecture for montgomery modular multiplication

Authors:
Yuan-Yang Zhang;Zheng Li;Lei Yang;Shao-Wu Zhang
Affiliations:
Institute of Electronic Technology, Information Engineering University, Zhengzhou 450004, PR China;Institute of Electronic Technology, Information Engineering University, Zhengzhou 450004, PR China;Institute of Electronic Technology, Information Engineering University, Zhengzhou 450004, PR China;Institute of Electronic Technology, Information Engineering University, Zhengzhou 450004, PR China
Venue:
Microprocessors & Microsystems
Year:
2007

Citing 6
Cited 1

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
Systolic Modular Multiplication

IEEE Transactions on Computers
Montgomery Modular Exponentiation on Reconfigurable Hardware

ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Modified Radix-2 Montgomery Modular Multiplication to Make It Faster and Simpler

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
New directions in cryptography

IEEE Transactions on Information Theory

An iterative logarithmic multiplier

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Montgomery multipliers of carry save adder (CSA) architecture require a full addition to convert the carry save representation of the result into a conventional form. In this paper, we reuse the CSA architecture to perform the result format conversion, which leads to small area and fast speed. The results of implementation on FPGAs show that the new Montgomery multiplier is about 113.4Mbit/s for 1024-bit operands at a clock of 114.2MHz.