An Efficient Cryptosystem to Perform Encryption and Decryption of Data

Authors

  • Manila Vishwakarma PG Student, Computer Science and Engineering, Institute of Engineering and Science, Institute of Professional Studies, Indore, Madhya Pradesh, India
  • Sourabh Jain Assistant Professor, Computer Science and Engineering, Institute of Engineering and Science, Institute of Professional Studies, Indore, Madhya Pradesh, India

Keywords:

Network Security, Cryptography, Elgamal Cryptosystem, Two key cryptography, Complexity

Abstract

The backbone of the modern world is electronic communication. Data is transferred from one place to another in almost no time using the electronic medium. But it also exposes the confidential data to the intruder. RSA is the most common and efficient cryptography technique that is used for the purpose of encrypting the content and then sending it over the channel, then than at receivers end the content is decrypted and converted in to original form. Although there are many security mechanisms are available. But there is a continuous need to improve the existing methods. Cryptography is a security mechanism which caters the security services of world in perfect manner.

References

W. Stallings. Network Security Essentials (Applications and Standards). Pearson Education. 2004.

National Bureau of Standards. Data Encryption Standard. FIPS Publication. 46. 1977.

P. Sharma, “Modified Integer Factorization Algorithm using V-Factor Method”, Second International Conference on Advanced Computing & Communication Technologies, IEEE. 2012.

A Hamami, I. A. Aldariseh, “Enhanced Method for RSACryptosystem Algorithm”, International Conference on Advanced Computer Science Applications and Technologies, IEEE. 2012.

S A Minaam, M Hatem, A Kader and M M. Hadhoud, “Evaluating the Effects of Symmetric Cryptography Algorithms on Power Consumption for Different Data Types”, International Journal of Network Security, Vol. 11, No. 2, pp.78-87. Sept.

V. Rijndael, “The Advanced Encryption Standard”, Dr. Dobb’s Journal. March 2001.

S Mehrotra and R.Mishra, “Comparative Analysis Of Encryption Algorithms For Data Communication”, IJCST, Vol. 2, No. 2. pp. 192-192. June 2011.

S A M Rizvi1, Hussain S Z and N. A Wadhwa, “Comparative Study of Two Symmetric Encryption Algorithms across Different Platforms”.

J A. Jose, “Possible Attack on RSA Signature. Research scholar”, Sathyabama University. Chennai.

M Abdalla, M Bellare and P. Rogaway, “The oracle Diffie-Hellman assumptions and an analysis of DHIES”, In David Naccache, editor, CT-RSA 2001. Vol. 20, of LNCS. pp. 143–158.Springer-Verlag.

M S Hwang, C C Chang and K F. Hwang, “An ElGamallike cryptosystem for enciphering large messages”, IEEE Trans. Knowledge and Data Engineering, Vol. 2. pp. 445- 446. 2002.

M N Wang, S M Yen, C D Wu and C T. Lin, “Cryptanalysis on an ElGamal-like cryptosystem for encrypting large messages”, Proceeding of the 6th WSEAS International conference of Applied Informatics and communications. pp. 418-422. 2006.

D Cash, E Kiltz and V.Shoup, “The Twin DiffieHellman problem and applications”, 2009.

S A M Rizvi1, S Z Hussain and N.Wadhwa, “A Comparative Study of Two Symmetric Encryption Algorithms Across Different Platforms”.

G Singh, A K Singla and K S.Sandha, “Through Put Analysis of Various Encryption Algorithms”, IJCST. Vol. 2, No. 3, 2011.

S M Seth and R.Mishra, “Comparative Analysis of Encryption Algorithms For Data Communication”, IJCST. Vol. 2, No. 2. pp. 192-192. 2011.

Published

05-05-2018