Call for Paper - November 2022 Edition
IJCA solicits original research papers for the November 2022 Edition. Last date of manuscript submission is October 20, 2022. Read More

An Enhanced Cryptosystem based on Shorter Keys and New Security Component

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Alaa Alslaity, Thomas Tran
10.5120/ijca2017914150

Alaa Alslaity and Thomas Tran. An Enhanced Cryptosystem based on Shorter Keys and New Security Component. International Journal of Computer Applications 166(8):44-50, May 2017. BibTeX

@article{10.5120/ijca2017914150,
	author = {Alaa Alslaity and Thomas Tran},
	title = {An Enhanced Cryptosystem based on Shorter Keys and New Security Component},
	journal = {International Journal of Computer Applications},
	issue_date = {May 2017},
	volume = {166},
	number = {8},
	month = {May},
	year = {2017},
	issn = {0975-8887},
	pages = {44-50},
	numpages = {7},
	url = {http://www.ijcaonline.org/archives/volume166/number8/27693-2017914150},
	doi = {10.5120/ijca2017914150},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Public-key (or asymmetric key) algorithms are the most dominant cryptographic algorithms in the cryptography era. RSA, in particular, is a good example of algorithms that belong to this category which is used for many applications and its security is beyond doubt. The key size of RSA is an important factor that determines its robustness. As the computational powers evolve, the need to increase the security of cryptosystems becomes essential to achieve more robustness against cryptanalysis attacks. In the literature, the commonly used solution to achieve this goal is to increase the key size. However, in practice, keeping increasing the key size is not feasible and not unlimited; increasing the key size demands more computational power. The increase in computational power makes it hard (or impossible) to conduct the encryption process in some environments such as smart cards. Also, it should be taken into consideration that the dramatic increase in computational capabilities of new machines improves their abilities to break encryption keys. Therefore, an alternative to increasing the key size is essentially needed. In this paper, we propose a new approach for encryption that is based on RSA main algorithm while using more encryption keys with smaller sizes in addition to extra security information component (known as the Security Card, SeCa). Our results show that the use of multiple-shorter keys with the SeCa component produces significant improvements in the performance of RSA algorithm in terms of increasing security and reducing the computation overhead by decreasing encryption and decryption times.

References

  1. G. Singh and S. Supriya, “A Study of Encryption Algorithms (RSA, DES, 3DES and AES) for Information Security”, International Journal of Computer Applications, Volume 67– No.19, (2013), pp. 33-38.
  2. Wikipedia, “Cryptography“, [Online] Available: https://en.wikipedia.org/wiki/Cryptography, [Accessed, 12 April 2016]
  3. Dictionary.com, “Cryptography”, [Online] Available: http://www.dictionary.com/browse/cryptography%20?s=t. , [Accessed 19 April 2016]
  4. A. A. Ayele and V. Sreenivasarao, “A Modified RSA Encryption Technique Based on Multiple public keys”, International Journal of Innovative Research in Computer and Communication Engineering Vol. 1, (2013).
  5. A. Alhasib and A. L.Haque, "A Comparative Study of the Performance Issues of the AES and RSA Cryptography",in Proc. 3rd International Conference on Convergence and Hybrid Information Technology (ICCIT), Busan, (2008), pp.505-510.
  6. Thakur, Jawahar, and N. Kumar. "DES, AES and Blowfish: Symmetric key cryptography algorithms simulation based performance analysis.", International journal of emerging technology and advanced engineering Volume 1.2 (2011), pp. 6-12.
  7. R. Rivest, A. Shamir, and L. Adleman, "A Method For Obtaining Digital Signatures and Public Key Cryptosystems", ACM Transactions on Communications, Vol. 21, (1978), pp. 120-126.
  8. E. Thambiraja, G. Ramesh and R. Umarani, "A Survey on Various Most Common Encryption Techniques", International Journal of Advanced Research in Computer Science and Software Engineering, Volume 2, Issue 7, (2012), pp. 226-233.
  9. R. Biswas, S. Bandyopadhyay and A. Banerjee, “Fast Implementation of the RSA Algorithm Using the GNU MP library”, in Proc. National workshop on cryptography, (2003), pp. 1–15..
  10. RSA Laboratory, “What key Size Should Be Used?”, EMC, [Online]. Available: http://www.emc.com/emc-plus/rsa-labs/historical/twirl-and-rsa-key-size.htm, [Accessed, 1 March 2016]
  11. S. Adi and E. Tromer. "Factoring large numbers with the TWIRL device", Advances in Cryptology-CRYPTO. Springer Berlin Heidelberg, (2003), pp. 1-26.
  12. Vocal, "RSA Key Size Selection," [Online]. Available: http://www.vocal.com/cryptography/rsa-key-size-selection/#. [Accessed, 3 March 2016].
  13. F. Fatemi, M. Maen, T. Alrashdan and O. Karimi, "A Hybrid Encryption Algorithm based on Small-e and Efficient RSA for Cloud Computing Environments", Journal of Advances in Computer Network, Vol. 1, No. 3, (2013). Available Online at http://www.jacn.net.
  14. S. J. Aboud, M. A. Alfayoumi, M. Alfayoumi and H. Jabbar, "An Efficient RSA Public Key Encryption Scheme", in Proc. ITNG, (2008), pp.127-130.
  15. D. Pointcheval, "New Public Key Cryptosystem based on the Dependent-RSA Problem", in Proc. LNCS, Springer-Verlag, Berlin-Heidelberg, (1999), pp.239-254.
  16. Gupta, Swastik, and Jaibir Sharma. "A hybrid encryption algorithm based on RSA and Diffie-Hellman." Computational Intelligence & Computing Research (ICCIC), 2012 IEEE International Conference on. IEEE, 2012.
  17. Deshmukh, Shyam, and Rahul Patil. "Hybrid cryptography technique using modified Diffie-Hellman and RSA."
  18. Marwaha, Mohit, et al. "Comparative analysis of cryptographic algorithms."Int J Adv Engg Tech/IV/III/July-Sept 16 (2013): 18.
  19. Al-Hamami, Alaa Hussein, and Ibrahem Abdallah Aldariseh. "Enhanced method for RSA cryptosystem algorithm." Advanced Computer Science Applications and Technologies (ACSAT), 2012 International Conference on. IEEE, 2012.
  20. Hassan, Abdel-karim SO, Ahmed F. Shalash, and Naglaa F. Saudy. "MODIFICATIONS ON RSA CRYPTOSYSTEM USING GENETIC OPTIMIZATION." International Journal of Research and Reviews in Applied Sciences 19.2 (2014): 150.
  21. N. Muhammadi, J. M. Zaini and M. Y. Saman, “Loop-based RSA Key Generation Algorithm using String Identity”, in Proc. 13th International Conference on Control, Automation and Systems, ICCAS (2013).
  22. A. Odeh, K. Elleithy, M. Alshowkan and E. Abdelfattah, “Quantum Key Distribution by Using Public Key Algorithm(RSA)”, IEEE, (2013)
  23. R. Patidar and R. Bhartiya, “Modified RSA Cryptosystem Based on Offline Storage and Prime Number”, IEEE, (2013).
  24. L. Wang and Y. Zhang, “A New Personal Information Protection Approach Based on RSA Cryptography”, IEEE, (2011).

Keywords

Security, RSA, Encryption, Decryption, Cryptanalysis Attack, Cryptography, Asymmetric Key, Key Size