Open Access Journal

ISSN : 2394 - 6849 (Online)

International Journal of Engineering Research in Electronics and Communication Engineering(IJERECE)

Monthly Journal for Electronics and Communication Engineering

Open Access Journal

International Journal of Engineering Research in Electronics and Communication Engineering(IJERECE)

Monthly Journal for Electronics and Communication Engineering

ISSN : 2394-6849 (Online)

Efficient Modular Exponentiation Architectures for RSA Algorithm

Author : S. Prasanth kumar 1 K.J.Jegadish kumar 2 B.Partibane 3

Date of Publication :7th May 2016

Abstract: Cryptosystems are used to send confidential messages in secure manner. The most important and efficient type of cryptosystem is RSA. RSA is used in various sectors such as Bank security and Internet protection. One of the various steps involved in RSA is Modular exponentiation, which is used in both Encryption and Decryption. It takes high memory and computation time of algorithm. In order to reduce the computation time of algorithm, the Modular exponentiation complexity is reduced. In this paper, we explain efficient novel Modular exponentiation. This is done by FPGA implementation using ZedBoard and comparing them with the previous methods.

Reference :

  1. [1] Bagus Hanindhito, Nur Ahmadi, Hafez Hogantara, Annisa I. Arrahmah, Trio Adiono (2015), ‘FPGA Implementation of Modified Serial Montgomery Modular Multiplication for 2048-bit RSA Cryptosystems’ ,IEEE 978-1-4799-7711-6/15

    [2] Ashbir A.Fadila, Naufal Shidqi, Trio Adiono (2015), ‘Hardware Implementation of Montgomery Modular Multiplication Algorithm Using Iterative Architecture’, IEEE Vol.35,No. 4.

    [3] Miaoqing Huang, Kris Gaj, and Tarek El-Ghazawi (2011), ‘New Hardware Architectures for Montgomery Modular Multiplication Algorithm’ IEEE Transactions on computers, Vol.60,No.7.

    [4] Dimitrios Schinianakis, Thanos Stouraitis (2014), ‘Multifunction Residue Architectures for Cryptography’ IEEE Transactions on circuit and system, Regular papers, Vol. 61, No.4

    [5] Nahed Mulla, Dr.Bncoet (2014), ‘FPGA Implementation of An Efficient Montgomery Multiplier for Adaptive Filtering Application’ IEEE Vol. 25, No.4.

    [6] Donald Donglong Chan (2000), ‘Parameter Space for the Architecture of FFT-based Montgomery Modular Multiplication’, IEEE Transaction on VLSI, Vol 32, No. 11.

    [7] A.Gonzale (2006), ‘Double-Residue Modular Range Reduction for Floating-point Hardware Implementation’, IEEE Transactions on computers, Vol.55,No. 3.

    [8] Pingjian Wang, Zongbin Liu, Lei Wang, Neng Gao (2013), ‘High Radix Montgomery Modular Multiplier on Modern FPGA’, 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications.

    [9] Ho Won Kim, and Sunggu Lee(2004), ‘Design and Implementation of a Private and Public Key Crypto Processor and its Application to a Security System’, IEEE Transactions on Consumer Electronics, Vol.35,No. 4.

    [10] K.P.Sridhar, M.Raguram, Prakash, S.Koushighan, (2014), ‘Secured Elliptic Curve Cryptosystem for Scan Based VLSI Architecture’, IEEE ISBN 1-7758-774-91


Recent Article