Quantum Cryptography for Enhanced Data Security: A Comparative Survey of Data Encryption and Decryption of Error Correction

Authors

  • Matthew Tsepav IBB University, Lapai
  • Baba Alfa Ibrahim Badamasi Babangida University, Lapai
  • Y. Adamu Ibrahim Badamasi Babangida University, Lapai
  • Adesiyan Adedeji Ibrahim Badamasi Babangida University, Lapai

DOI:

https://doi.org/10.62292/njtep.v2i2.2024.22

Keywords:

Data Security, Cryptography, Gaussian Backward Interpolation, Gaussian First Forward Interpolation Formula, ASCIIvalues, Cryptographic algorithm, RSA, Hybrid algorithm, SRNN, 2-Key pair

Abstract

Data information security is a crucial concern that ought to be managed to help protect vital data. Cryptography is one of the conventional approaches for securing data and is generally considered a fundamental data security component that provides privacy, integrity, confidentiality, and authentication. In this paper, a comparative survey of Rivest-Shamir-Adleman (RSA) data security algorithm is proposed in order to compare their security strength. In doing so, we integrate traditional RSA and Gaussian Interpolation formulas to test their security level. The integration raised the security strength of RSA to the fifth degree,while the Gaussian First Forward Interpolation was used to encrypt the ASCII values of the message after which the traditional RSA was used to encrypt and decrypt the message in the second and third levels. Comparative data security analysis was performed using four different algorithms; RSA, SRNN, 2-Key pair algorithms, and the results showed that when the data size was small, the encryption and decryption times were lower for the proposed algorithm but higher when the data size was big. Thus the two public keys used and some mathematical relations made the eavesdropper not to get much knowledge about the key and therefore, unable to decrypt the message.

Author Biography

Baba Alfa, Ibrahim Badamasi Babangida University, Lapai

Professor, Department of Physics, IBB University, Lapai

References

Balasubramanian, K. (2014)."Variants of RSA and their cryptanalysis. InternationalConference on Communication and Network Technologies,pp.145-149, doi:10.1109/CNT.2014.7062742.

Bonde S. Y. and U. S. Bhadade, “Analysis of encryption algorithms (RSA, SRNN and 2 keypair) for information security,” 2017 International Conference on Computing,Communication, Control and Automation (ICCUBEA), 2017. doi: 10.1109/ICCUBEA.2017.8463720

Devi M. S.(2016). “Threshold SR2N public key cryptosystem,” International Journal of Engineering Trends and Technology, vol. 31, no. 1, pp. 15–17. doi: 10.14445/22315381/IJETT-V9P265

Panda P.K.and S. Chattopadhyay (2017). “A hybrid security algorithm for RSA cryptosystem,” in 2017 4th International Conference on Advance Computing and Communication Systems(ICACCS), doi: 10.1109/ICACCS.2017.8014644

Rivest R. L., A. Shamir, and L. Adleman (1978). “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126,.

https://doi.org/10.5772/intechopen.114973

Rivest, D. R., Shamir, A., & Adleman, L. (1977). RSA (cryptosystem). Arithmetic Algorithms And Applications, 19. https://en.wikipedia.org/wiki/RSA_(cryptosystem)

Rutkowski E. and S. Houghten (2020). "Cryptanalysis of RSA: Integer Prime Factorization UsingGenetic Algorithms," IEEE Congress on Evolutionary Computation (CEC), p.1-8, doi: 10.1109/CEC48606.2020.9185728.

Tseng Y.-M., (2007). An efficient two-party identity-based keyexchange protocol,” Informatica, vol. 18, no. 1, pp. 125–136, https://eprint.iacr.org/2009/441

UddinM., Md. Kowsher and Mir Md. Moheuddin, (2019)."A New Method Of Central DifferenceInterpolation", Applied Mathematics and Sciences An International Journal (MathSJ), vol. 6, no.3, pp. 01-14, doi:10.5121/mathsj.2019.6301

Downloads

Published

2024-06-30