International Research journal of Management Science and Technology

  ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 225    Submit Your Rating     Cite This   Download        Certificate

AN IMPROVED RSA USING MAGIC RECTANGLE AND PELL’S EQUATION

    1 Author(s):  MUKESH

Vol -  10, Issue- 4 ,         Page(s) : 167 - 172  (2019 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

The efficiency of cryptographic algorithm is not only based on the time taken for encryption and decryption, but also the number of levels used to get the cipher text from a plain text. The public key cryptosystem RSA is one of the widely used algorithms. However, several attacks are introduced to break this algorithm due to certain limitations. There is a possibility that we can find the private key by continues fraction method if private key lies in a certain range. This attack is known as wiener’s attack. One of the limitations in the past cryptosystem is using ASCII character for numerical representation of the text. It gives same cipher text for repeated characters in plain text. To overcome the above limitation, a new variant of RSA has been proposed in which key generation method is distinct and magic rectangle is introduced for improving the security. The key generation is based on Pell’s equation using faster multiplication algorithm SSA. Magic rectangle is helpful to enhance the security due to its complexity in encryption process. The magic rectangle formation based on seed number, start number, row sum and column sum. The proposed work introduces one more level of security in public key algorithm RSA

[1] J.Sai Geetha , D.I. George Amalarethinam “Enhancing Security level for Public Key Cryptosystem using MRGA” 2014 IEEE world Conference on computing and communication technologies .
[2] Hardik gandhi, vinit gupta, indra rajput, “A Research on Enhancing Public Key Cryptography by The Use of MRGA N-Prime RSA” International Journal of Innovative Research in Computer and Communication Engineering ISSN (Online): 2349 – 6010Vol.1, Issue 12, may 2015
[3] Thiranant, Young Sil Lee, HoonJae Lee , “Performance Comparison between RSA and Elliptic Curve Cryptography-based” 2015 IEEE , 29th International Conference on Advanced Information Networking and Applications Workshops
[4] Elaine L. Render August, “Wiener's Attack on Short Secret Exponents”, Reference  Site -IEEE, Proceedings of August 15, 2007.
[5] Gopinath Ganapathy, and K.Mani , “ Add-On Security Model for public key Cryptosystem Based on Magic Square Implementation”, ISBN 978-988-17012-6-8, Proceedings of the world congress on Engineering and Computer Science 2009 Vol I, San Fransisco, USA
[6] http://searchsecurity.techtarget.com/definition/RSA
[7] https://en.wikipedia.org/wiki/RSA_(cryptosystem)
[8] B R Ambedkar, Ashwani Gupta, Pratiksha Gautam, “An Efficient Method to Factorize the RSA Public Key Encryption”, International Conference on Communication Systems and Network Technologies, 2011.
[9] https://en.wikipedia.org/wiki/Sch%C3%B6nhage_Strassen_Algorithm.
[10] http://mathworld.wolfram.com/PellEquation.html.
[11]  Sahadeo Padhye “A Public Key Cryptography Based on PELL‟S Equation “in School of Studies in Mathematics.
[12] Michael J.JacobSon and Jr.Hugh C.Williams 2009 “Solving the Pell Equation”, pages 353-359.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details