Dual-residue montgomery multiplication

Authors:
Anding Wang;Yier Jin;Shiju Li
Affiliations:
College of Information Science & Engineering, Zhejiang University, Hangzhou, China;College of Information Science & Engineering, Zhejiang University, Hangzhou, China;College of Information Science & Engineering, Zhejiang University, Hangzhou, China
Venue:
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Year:
2007

Citing 9
Cited 0

Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor

Proceedings on Advances in cryptology---CRYPTO '86
Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition

IEEE Transactions on Computers
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Analyzing and Comparing Montgomery Multiplication Algorithms

IEEE Micro
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm

IEEE Transactions on Computers
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
Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)

IEEE Transactions on Computers
Bipartite modular multiplication

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper introduces a new approach based on dual residue system to compute Montgomery multiplication. The novelty of this proposal is that we import an extra Montgomery residue system with new transformation constant beside the normal one. In this way, one of the multiplicand can be divided into two parts and both higher and lower parts are calculated in parallel to speed up computation. Then two implementations in hardware are proposed for the algorithm. In parallel architecture, the proposed algorithm can perform nearly twice speedup compared to normal Montgomery method. And in pipeline architecture, the computation speed can be even faster. Besides speeding up calculation the extra merit of our proposal is that the multiplier can partial replace Montgomery multiplier used nowadays without any changes on top architecture.