Corpus ID: 89607492

VLSI ARCHITECTURE FOR MONTGOMERY MODULAR MULTIPLICATION ALGORITHM BY USING PASTA ADDER

@inproceedings{Farook2017VLSIAF,
  title={VLSI ARCHITECTURE FOR MONTGOMERY MODULAR MULTIPLICATION ALGORITHM BY USING PASTA ADDER},
  author={Shaik Farook and N. Priya},
  year={2017}
}
In data transmission applications, the widely used public-key cryptosystem is a simple and efficient Montgomery multiplication algorithm such that the low-cost and highperformance. In which includes encryption and decryption process. The Montgomery 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 precomputation and format… Expand
1 Citations

Figures and Tables from this paper

LOW-COST HIGH-PERFORMANCE VLSI ARCHITECTURE USING MONTGOMERY MODULAR MULTIPLICATION
Montgomery Modular Multiplication is a method for performing fast modular multiplication. It is used for encryption process in Public Key Cryptography. The Project consists of Semi Carry Save (SCS)Expand

References

SHOWING 1-9 OF 9 REFERENCES
Low-Cost High-Performance VLSI Architecture for Montgomery Modular Multiplication
TLDR
A mechanism that can detect and skip the unnecessary carry-save addition operations in the one-level CCSA architecture while maintaining the short critical path delay is developed and the extra clock cycles for operand precomputation and format conversion can be hidden and high throughput can be obtained. Expand
Energy-Efficient High-Throughput Montgomery Modular Multipliers for RSA Cryptosystems
TLDR
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. 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
Montgomery modular multiplication on reconfigurable hardware: Fully systolic array vs parallel implementation
TLDR
A comparison of two FPGA Montgomery modular multiplication architectures: a fully systolic array and a parallel implementation and it is compared the time x area efficiency for both architectures as well as a RSA application. Expand
Fast scalable radix-4 Montgomery modular multiplier
TLDR
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. Expand
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/kExpand
Parallelization of Radix-2 Montgomery Multiplication on Multicore Platform
TLDR
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. Expand
Satoh,“Systematicdesign of RSA processors based on highradix Montgomery multipliers,”IEEE
  • Trans. Very Large Scale Integr. (VLSI) Syst.,
  • 2011
Systematicdesign of RSA processors based on highradix Montgomery multipliers
  • IEEE Trans . Very Large Scale Integr . ( VLSI ) Syst .