jzs-10748

Selective Multi Keys to Modify RSA Algorithm

Maiwan Bahjat Abdulrazzaq1

1 Department of Computer Science, Faculty of Science, University of Zakho, Kurdistan Region, Iraq. 

Original: 3 November 2018, Revised: 10 January 2019, Accepted: 17 February 2019, Published online: 20 June 2019 

DOI Link: https://doi.org/10.17656/jzs.10748

Abstract

The use of the internet and communication technology noticeably contributes to development in all branches of science. The data that is transferred to communication channel are unsecured. Cryptography including security and integrity is a domain that provides policies for having privacy of the data. Protection of the data transferred through the internet is very important since such data when transferred through an unprotected channel may be attacked by a third party. RSA represents one of the public key cryptography methods that generate the modulus using two primes. These two primes represent the weakness of RSA benefited from and used by attackers. This paper proposes a new modified RSA method using selective multi keys encryption and decryption for the same modulus instead of using two keys, one for encryption and the other for decryption. This new method guarantees and increases the security of RSA.

Key Words:  Cryptography, public key cryptography, RSA algorithm, asymmetric key, symmetric key.

    References

[1] A. K. Mishra and S. G. Samaddar, "Generation of symmetric sharing key using ABC conjecture",  International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS), 2017, pp. 144-150. (2017).

[2] M. Elia, M. Piva, and D. Schipani, "The Rabin cryptosystem revisited", Applicable Algebra in Engineering, Communication and Computing. Vol. 26, pp. 251-275. (2015).

[3] M.-S. Hwang, C.-C. Chang, and K.-F. Hwang, "An ElGamal-like cryptosystem for enciphering large messages", IEEE Transactions on Knowledge and Data Engineering. Vol. 14, pp. 445-446. (2002).

[4] M. Rosing, "Implementing elliptic curve cryptography", Manning Greenwich, (1999).

[5] S. J. Aboud, M. A. AL-Fayoumi, M. Al-Fayoumi, and H. S. Jabbar, "An efficient RSA public key encryption scheme", in Information Technology: New Generations 2008. Fifth International Conference on, 2008, pp. 127-130. (2008).

[6] F. F. Moghaddam, S. D. Varnosfaderani, I. Ghavam, and S. Mobedi, "A client-based user authentication and encryption algorithm for secure accessing to cloud servers based on modified Diffie-Hellman and RSA small-e", in Research and Development (SCOReD), IEEE Student Conference on, 2013, pp. 175-180. (2013).

[7] V. Shende and M. Kulkarni, "FPGA based hardware implementation of hybrid cryptographic algorithm for encryption and decryption", in Electrical, Electronics, Communication, Computer, and Optimization Techniques (ICEECCOT), International Conference on, 2017, pp. 416-419. (2017).

[8] M. Lakkadwala and S. Valiveti, "Parallel generation of RSA keys—A review", in Cloud Computing, Data Science & Engineering-Confluence, 7th International Conference on, 2017, pp. 350-355. (2017).

[9] R. S. Dhakar, A. K. Gupta, and P. Sharma, "Modified RSA encryption algorithm (MREA)", Second International Conference on Advanced Computing & Communication Technologies, 2012, pp. 426-429. (2012).

[10]K. Somsuk, "The improving decryption process of RSA by choosing new private key", in Information Technology and Electrical Engineering (ICITEE), 8th International Conference on, 2016, pp. 1-4. (2016).

[11]P. Chaudhury, S. Dhang, M. Roy, S. Deb, J. Saha, A. Mallik, et al., "ACAFP: Asymmetric key based cryptographic algorithm using four prime numbers to secure message communication. A review on RSA algorithm", in Industrial Automation and Electromechanical Engineering Conference (IEMECON), 8th Annual, 2017, pp. 332-337. (2017).

[12]I. G. Amalarethinam and H. Leena, "Enhanced RSA Algorithm with Varying Key Sizes for Data Security in Cloud", in Computing and Communication Technologies (WCCCT),  World Congress on, 2017, pp. 172-175. (2017).

[13]A. Goel, "Encryption algorithm using dual modulus", in Computational Intelligence & Communication Technology (CICT), 3rd International Conference on, 2017, pp. 1-4. (2017).

[14]I. Yakymenko, M. Kasianchuk, S. Ivasiev, A. Melnyk, and Y. M. Nykolaichuk, "Realization of Rsa cryptographic algorithm based on vector-module method of modular exponention", in Advanced Trends in Radioelecrtronics, Telecommunications and Computer Engineering (TCSET), 14th International Conference on, 2018, pp. 550-554. (2018).

[15]T. C. Segar and R. Vijayaragavan, "Pell's RSA key generation and its security analysis", in Computing, Communications and Networking Technologies (ICCCNT), Fourth International Conference on, 2013, pp. 1-5. (2013).

Full Text

     Copyright (c) 2018 : Maiwan Bahjat Abdulrazzaq

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.