Open Access Open Access  Restricted Access Subscription or Fee Access

Power-Efficient Montgomery Modular Multiplication Review Using VLSI Architecture

Swati Singh Solanki, Anil Kumar Sahu

Abstract


In Public key Cryptosystem like RSA and Elliptic Curve Cryptography (ECC), modular multiplication is a basic operation. A famous method to execute modular multiplication in hardware circuit is based on the Montgomery modular multiplication it has several benefits. Many Montgomery Modular multiplication hardware architecture and algorithm employ carry-save addition (CSA), to speed up the encryption/decryption process. An adiabatic logic brings about great deal of power minimization in digital circuit. This research paper presents a review of previous work done on modular multiplication and suggest a new CSA based Montgomery modular multiplier architecture designed utilizing adiabatic logic to make it low power consuming as compare to CMOS-Logic circuit.


Keywords


Public-Key Cryptosystem, Carry Save Addition (CSA), Montgomery Modular Multiplication, Adiabatic Logic, Low Power Consumption.

Full Text:

PDF

References


Shiann-Rong Kuang, Kun-Yi-Wu and Ren-Yao Lu “Low Cost High Performance VLSI Architecture for Montgomery Modular Multiplication” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 24, no. 02, Feb. 2016.

Ebin Geo.Johnson, Nethu.K “Efficiency And Performance Review of Montgomery Modular Multiplication Based On VLSI Architecture” International Journal Of Engineering Research Vol. No. 5, Issue: Special 5, PP 992-1128 May 2016.

Vinodhini.N, Suganya.c “Pipelined VLSI architecture for RSA Based Montgomery Modular Multiplication” (GRDEJE/CONFERENCE/ICIET-2016/076) e-ISSN: 2455-5703 Jul. 2016.

V.ROOPA THEJASWINI, T.VIJAYA NIRMALA “Design of Modified Modular Multiplication For RSA Cryptosystem” International Industrial Scientific Engineering Corporation (IISRC ),International Conference On Industrial Scientific Research Engineering conference No.05, April 2015 PP: 112-116.

Anizha Radha Krishnan, Seena George “An Area Efficient Montgomery Modular Multiplier for Crypto System” Int. Journal Of Engineering research and Application. ISSN: 2248-9622, Vol.4 Issue 9(version1) PP 210-214, Sep 2014

Atef Ibrahim, Hamed Elsimary , Fayez Gebali “Low-Power, High-Speed Unified and Scalable Work Based Radix 8 Architecture for Montgomery Modular Multiplication in GF(P) and GF(2^n)”COMPUTER ENGINEERING AND COMPUTER SCIENCE,DOI 10.1007/s13369-014-1363-5,(2014)39:7847-7863(2014)

Shiann-Rong Kuang, Jiun-PingWang,Kai-Cheng and Huan-Wei-Hsu “ Energy-Efficient-High-Throughput Montgomery Modular Multiplier For RSA Cryptosystem” IEEE Transaction on Very Large Scale Integration (VLSI) system, Vol.21.No 11, Nov.2013

De-Sheng Chen ,Huan-Teng Li and Yi-Wen Wang “A Prediction -Based Scalable Design for Montgomery Modular Multiplication”3^rd International Conference on Electric and Electronics (EEIC 2013)

Joao Carlo Neto , Alexandre Ferreira Tenca and Wilson Vicente Ruggiera “ A Parallel K- Partition method To Perform Montgomery Multiplication” IEEE 2011.

Atef Ibrahim, Hamal El-simary & Fayez Gebai “High Performance, Low Power Architecture for Scalable Radix2 Montgomery Modular Multiplication Algorithm”CAN.J.ELECT.Computer.Eng.Vol.34, No_4 Fall_2009.

Xinjian Zheng, Zexiang Liu and Bo peng “Design and implementation of an ultra-low power RSA coprocessor, 836 Hi-tech research and development program of china, IEEE 2008(2005AA121080,2007AA012459).

ZHANG Rui, He Debiao, CHEN Janhua, HU Jin “ High- speed Montgomery modular multiplication using high Radix systolic multiplier” Scientific research proceeding of conference and computation faculty2009.

David Harris, Ram Krishanmurthy , Mark Anders, sanu Mathew and Steven Hsu “ An Improved Unified Scalable Radix-2 Montgomery Multiplier” Proceedings of the 17th IEEE Symposium On computer arithmetic (ARITH’05)2005

S.-R. Kuang, J.-P. Wang, K.-C. Chang, and H.-W. Hsu, “Esnergy-efficient high-throughput Montgomery modular multipliers for RSA cryptosystems,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 21, no. 11, pp. 1999–2009, Nov. 2013.

C. D. Walter, “Montgomery exponentiation needs no final subtractions,” Electron. Lett., vol. 35, no. 21, pp. 1831–1832, Oct. 1999.

Atul Kumar Maurya, Gagnesh Kumar “Adiabatic Logic: Energy Efficient technique For VLSI Application” International Conference on computer and communication technology (ICCCT) – 2011.

Tanuja Jaggi, Ravinder Kumar, “Performance Analysis Of Positive Feed Back Adiabatic Logic For Low Power” International Journal Of Advance Research in Electrical Electronics and Instrumentation Engineering, Vol.2, Issue 9 Sep 2013.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.