CFP last date
20 May 2024
Reseach Article

Secure Key Exchange using RSA in Extended Playfair Cipher Technique

by Surendra Singh Chauhan, Hawa Singh, Ram Niwas Gurjar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 104 - Number 15
Year of Publication: 2014
Authors: Surendra Singh Chauhan, Hawa Singh, Ram Niwas Gurjar
10.5120/18277-9180

Surendra Singh Chauhan, Hawa Singh, Ram Niwas Gurjar . Secure Key Exchange using RSA in Extended Playfair Cipher Technique. International Journal of Computer Applications. 104, 15 ( October 2014), 13-19. DOI=10.5120/18277-9180

@article{ 10.5120/18277-9180,
author = { Surendra Singh Chauhan, Hawa Singh, Ram Niwas Gurjar },
title = { Secure Key Exchange using RSA in Extended Playfair Cipher Technique },
journal = { International Journal of Computer Applications },
issue_date = { October 2014 },
volume = { 104 },
number = { 15 },
month = { October },
year = { 2014 },
issn = { 0975-8887 },
pages = { 13-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume104/number15/18277-9180/ },
doi = { 10.5120/18277-9180 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:36:13.975488+05:30
%A Surendra Singh Chauhan
%A Hawa Singh
%A Ram Niwas Gurjar
%T Secure Key Exchange using RSA in Extended Playfair Cipher Technique
%J International Journal of Computer Applications
%@ 0975-8887
%V 104
%N 15
%P 13-19
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In today's digital world cryptography is used to secure information in order to provide the privacy for the intended sender and receiver by managing the message with the public key. The objective of this work is to securing the key of Playfair cipher using RSA algorithm. It is a two stage application, in first stage the existing methods of Playfair cipher modified by increasing in the size of matrix, so that the restrictions of earlier works of PF cipher using 5×5 matrix were overcome in the proposed work. The proposed method use a 12×8 matrix which contain all alphabetic, numeric and special character use in keyboard as input. This work is an enhancement to the existing algorithms that uses 5×5 matrix to pick cipher characters. It makes use of alphabets both lower and upper case characters, number and special characters for constructing the contents of the matrix. In the second stage, RSA public key encryption technique is used for sending the key of the PF ciphers securely. Finally, the security strength of the whole system has been analyzed and tried to fulfil the requirement of security.

References
  1. Ravindra Babu K, S. Uday Kumar, A. Vinay Babu, I. V. N. S. Aditya, P. Komuraiah, "An Extension to Traditional PF Cryptographic Method". International Journal of Computer Applications (0975 – 8887), Volume 17- No. 5, March 2011.
  2. S. S. Dhenakaran, M. Ilayaraja, "Extension of PF Cipher using 16X16 Matrix", International Journal of Computer Applications (0975 – 888), Volume 48– No. 7, June 2012.
  3. Chandra M. Kota and Cherif Aissi1," Implementation of the RSA algorithm and its cryptanalysis".
  4. R. L. Rivest. A. Shamir and L. Adleman, "A method for obtaining digital signatures and public key cryptosystems," Commun. ACM, Vol. 21, No. 2, pp. 158-164, Feb 1978.
  5. Andrew S. Tanenbaum, Networks Computer, 5th Edition, Pearson Education, ISBN-10: 0132553171. Diffie, W. , and Hellman, M. New directions in cryptography. IEEE Trans. Inform. Theory IT-22,(Nov. 1976), 644-654.
  6. Diffie, W. , and Hellman, M. Exhaustive cryptanalysis of the NBS data encryption standard. Computer 10 (June 1977), 74-84.
  7. William Stallings, "Cryptography and Network Security: Principles and Practice", 4th edition, Prentice Hall, 2006.
  8. Atul Kahate, "Cryptography and Network Security", 2nd edition, McGraw-Hill, 2010.
  9. Bernard Menezes, "Network Security and Cryptography", CENGAGE Learning, 2014.
Index Terms

Computer Science
Information Sciences

Keywords

Playfair=PF Plaintext=PT Plaintext1=PT1 Plaintext2=PT2 Cipher text= CT Cipher text1= CT1 Cipher text2= CT2 Encryption Process =ET Decryption process=DT