High-Performance VLSI Architecture for SCS Based Montgomery Modular Multiplication

@article{Vaisalini2016HighPerformanceVA,
  title={High-Performance VLSI Architecture for SCS Based Montgomery Modular Multiplication},
  author={Bhanu Vaisalini and M. Pradeep},
  journal={IOSR journal of VLSI and Signal Processing},
  year={2016},
  volume={06},
  pages={48-52}
}
In present generation Cryptography plays a crucial role in security purpose. Security comes mostly with three parameters Confidentiality, Integrity and authentication. All these terms are important for a data to be secured. For hardware implementation of this process Montgomery Modular Multiplication is used, for encryption process in public key cryptography. This paper is discussing about the Semi Carry Save based Montgomery Modular Multiplication (SCS-MM2), with high speed performance. In… Expand

References

SHOWING 1-10 OF 10 REFERENCES
Fast Montgomery modular multiplication and RSA cryptographic processor architectures
TLDR
New, generic silicon architectures for implementing Montgomery's multiplication algorithm are presented and it is shown that using a four-to-two CSA with two extra registers rather than a five- to- two CSA leads to a useful reduction in the critical path of the multiplier, albeit at the expense of a small increase in circuitry. Expand
Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic
TLDR
Some new architectures are presented, including a pipelined architecture exploiting the maximum carry chain length of the FPGA which is used to implement the modular exponentiation operation required for RSA encryption and decryption. Expand
Efficient hardware architectures for modular multiplication on FPGAs
TLDR
This paper presents an implementation and comparison of three recently proposed, highly efficient architectures for modular multiplication on FPGAs: interleaved modular multiplication and two variants of the Montgomery modular multiplication, with the main findings that the interleaves multiplication has the least area time product of all investigated architectures. Expand
A staged carry-save-adder array for Montgomery modular multiplication
In this paper, an efficient VLSI architecture to compute the n-bit Montgomery modular multiplication is proposed. By using the staged carry save adder (CSA) array, the computation cycles of additionExpand
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
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two importantExpand
et.al.”Low Cost High Performance VLSI Architecture for Montgomery MM
  • IEEE Trans. Very Large Scale Inegr. (VLSI) Syst.,
  • 2016
“Implementation of Optimized Montgomery modular Multiplier on FPGA
  • International Journal of Advanced Research in Biology Engineering Science and Technology (IJARBEST)
  • 2016
Thirapaiah “ A High - Speed Montgomery Modular Multiplication Algorithm To Reduce The Energy Consumption Based On RSA Cryptosystem " , Proc
  • International Journal of Computer Trends and Technology ( IJCTT )Vol4 , Issue5May
  • 2013
Montgomery Multiplication MethodsA Review