• Corpus ID: 212468536

VLSI Implementation Of High Performance Montgomery Modular Multiplication For Crypto graphical Application

  title={VLSI Implementation Of High Performance Montgomery Modular Multiplication For Crypto graphical Application},
-The multiplier receives and outputs the data with binary representation and uses only one-level Carry Save Adder (CSA) to avoid the carry propagation at each addition operation. This CSA is also used to perform operand pre computation and format conversion from the carry save format to the binary representation, leading to a low hardware cost and short critical path delay at the expense of extra clock cycles for completing one modular multiplication. To overcome the weakness, a Configurable… 


Energy-Efficient High-Throughput Montgomery Modular Multipliers for RSA Cryptosystems
This paper proposes an energy-efficient algorithm and its corresponding architecture that is capable of bypassing the superfluous carry-save addition and register write operations, leading to less energy consumption and higher throughput of Montgomery modular multipliers.
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 systems
Modified Montgomery modular multiplication and RSA exponentiation techniques
Modified Montgomery multiplication and associated RSA modular exponentiation algorithms and circuit architectures are presented. These modified multipliers use carry save adders (CSAs) to perform
Systematic Design of RSA Processors Based on High-Radix Montgomery Multipliers
This paper presents a systematic design approach to provide the optimized Rivest-Shamir-Adleman (RSA) processors based on high-radix Montgomery multipliers satisfying various user requirements, such
Parallel high-radix Montgomery multipliers
The algorithm and design tradeoffs for multiple hardware implementations of parallel high-radix scalable Montgomery multipliers, and processing element designs exploring combinations of radices 2, 4, and 8, right vs. left shifting, and Booth encoding.
Fast scalable radix-4 Montgomery modular multiplier
The data dependency resulting from the inherent right shifting of the intermediate results in the conventional radix-4 Montgomery modular multiplication algorithm is alleviated and the latency between the neighboring process elements (PEs) is exactly one cycle.
Design of Modular Multiplier Based on Improved Montgomery Algorithm and Systolic Array
  • Feng Gang
  • Computer Science
    First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)
  • 2006
A improved CSA is used to remove the carry chain while implementing Montgomery algorithm, which has a shorter delay and aims to eliminate the signal's global broadcasting.
A parallel k-partition method to perform Montgomery Multiplication
This paper proposes a new approach to speed up the Montgomery Multiplication by distributing the multiplier operand bits into k partitions that can process in parallel. Each partition executes in n/k
Parallelization of Radix-2 Montgomery Multiplication on Multicore Platform
This brief presents an improved task partitioning of the Montgomery multiplication algorithm for the multicore platform with area-efficient processors to verify the efficiency of parallelization.
Guideline for Implementing Cryptography in the Federal Government
This document focuses on Federal standards documented in Federal Information Processing Standards Publications (FIPS PUBs) and the cryptographic modules and algorithms that are validated against these standards.