Design and Evaluation of Novel Effective Montgomery Modular Multiplication Architecture

  title={Design and Evaluation of Novel Effective Montgomery Modular Multiplication Architecture},
  author={Maryam Moayedi and Abdalhossein Rezai},
  journal={International journal of security and its applications},
  • M. Moayedi, A. Rezai
  • Published 31 October 2016
  • Computer Science
  • International journal of security and its applications
Secure communication is a challenging issue in modern industries and critical infrastructures. The core technology used for securing the communication is cryptography. Modular multiplication is an important operation in cryptosystems. This paper investigates a novel modular multiplication algorithm and architecture. In the proposed algorithm and architecture, the parallel architecture and compact SD technique are utilized to improve the performance of modular multiplication operation and… Expand
A novel approach for improving the modular exponentiation performance
Modular exponentiation (ME) that computes by repeating modular multiplications (M2), is main operation in public-key cryptosystems. In recent years, many researchers studied on improving M2 and MEExpand
An Efficient Architecture for Golay Code Encoder
An efficient architecture for hardware implementation of Golay code encoder is proposed and the developed encoder architecture provides a promising advantage compared to other encoder architectures for Golay codes. Expand
1PG Scholar, Dept. of ECE, Government Engineering College, Idukki, Kerala, India 2Assistant Professor, Dept. of ECE, Government Engineering College, Idukki, Kerala, IndiaExpand


High-performance scalable architecture for modular multiplication using a new digit-serial computation
A new scalable Montgomery modular multiplication architecture with variable-radix design with one clock cycle delay in data flow is proposed, which has area×time complexity and performance advantages compared to related algorithms/architectures. Expand
A new RSA encryption architecture and hardware implementation based on optimized Montgomery multiplication
A systolic, scalable, redundant carry-save modular multiplier and an RSA encryption architecture are proposed using the Montgomery modular multiplication algorithm, completely avoiding the transformations from redundant to non-redundant numbers at the intermediate stages of the architectures. Expand
A New Algorithm for High-Speed Modular Multiplication Design
This paper first explores how to relax the data dependency that exists between multiplication, quotient determination, and modular reduction in the conventional Montgomery modular multiplication algorithm, and proposes a new modularmultiplication algorithm for high-speed hardware design. Expand
High-Throughput Modular Multiplication and Exponentiation Algorithms Using Multibit-Scan–Multibit-Shift Technique
  • A. Rezai, P. Keshavarzi
  • Computer Science
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • 2015
A new and efficient Montgomery modular multiplication architecture based on a new digit serial computation that relaxes the high-radix partial multiplication to a binary multiplication and performs several multiplications of consecutive zero bits in one clock cycle instead of several clock cycles is presented. Expand
High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware
This contribution proposes arithmetic architectures which are optimized for modern field programmable gate arrays (FPGAs) that perform modular exponentiation with very long integers, at the heart of many practical public-key algorithms such as RSA and discrete logarithm schemes. Expand
High radix implementation of Montgomery multipliers with CSA
Modular multiplication is the key operation in systems based on public key encryption, both for RSA and elliptic curve (ECC) systems. High performance hardware implementations of RSA and ECC systemsExpand
New Hardware Architectures for Montgomery Modular Multiplication Algorithm
Two new hardware architectures that are able to perform the same operation in approximately n clock cycles with almost the same clock period are proposed, based on precomputing partial results using two possible assumptions regarding the most significant bit of the previous word. Expand
Compact SD: a new encoding algorithm and its application in multiplication
It is proved that the optimal range for the limit on the number of consecutive zero bits in each digit and average Hamming weight of n-bit integers in the compact SD representation are to and n/3, respectively. Expand
A radix-4 scalable design
It is shown that a more elaborate design using two types of digit recoding makes the radix-4 design the best solution for the implementation of this scalable multiplier. Expand
Architectures for Fast Modular Multiplication
This study proposes architectures for recently proposed method of interleaving the Karatsuba-Ofman multiplier and bipartite modular reduction on the upper most layer of Karatsubsuba- ofman's recursion by taking the advantage of a fast multiplication and a parallel reduction method. Expand