Reliable RSA Cryptosystem Using the Path Tracing Method

Authors

  • Ruma Kareem K. Ajeena Prof. Dr., Department of Computer Science, College of Education for Pure Science Ibn Al- Haitham, University of Baghdad & Scientists Foundation for Development, Baghdad, Iraq
  • Ban Jasim Kadim Researcher, Department of Mathematics, College of Education for Pure Science, University of Babylon, Babil, Iraq

DOI:

https://doi.org/10.58564/IJCCN.1.1.2025.6

Keywords:

Cryptography, RSA cryptosystem, Reliability, R-RSA, Security.

Abstract

The reliability theory has many applications in different areas, in mathematics, engineering,  manufacturing the devices, computer scinace and cryptography as well . A reliable cryptosystem: type RSA has been proposed in 2 dimension. The plaintext M has been divided into two parts m1 and m2 in the proposed reliable RSA cryptosystem (R-RSA). Sub-ciphertexts (C1, C2) and (C1’, C2’) form two paths which are corresponding to the parts m1 and m2 respectively. The encrypted plaintext is designed as a reliable system which considers a new main point in this work. The encryption and decryption processes on the proposed R-RSA cryptosystem are done uses the path tracing method (PTM) and parallel series reduction method (PSRM).  A study case of the R-RSA cryptosystem is discussed as a new experimental result. The security issues on R-RSA cryptosystem are determined. A more secure R-RSA cryptosystem has been designed for communication in compare to other previous cryptosystems.

References

[1] Z. Y. Karatas, E. Luy and B. Gonen, “A public key cryptosystem based on matrices,” Int. J. Comput. Appl, 182, 47-50, 2019.

[2] M. Maxrizal, “Public Key Cryptosystem Based on Singular Matrix,” Trends in Sciences, 19(3), 2147-2147, 2022.

[3] K. Prasad, H. Mahato and M. Kumari, “A novel public key cryptography based on generalized Lucas matrices,” arXiv preprint arXiv:2202.08156, 2022.

[4] R. K. K. Ajeena, “Integer matrix size 2× 2 sub-decomposition method for elliptic curve cryptography,” Computer Science, 18, No. 4, (2023), pp. 599-606.

[5] S. J. Yaqoob and R. K. K. Ajeena, “The Multi-Primes Lanstra's Elliptic Curve Factorization Algorithm,” In 2020 6th International Engineering Conference “Sustainable Technology and Development” (IEC), (IEEE, 2020), pp. 141-145.

[6] R. K. K. Ajeena and H. Kamarulhaili, “On the distribution of scalar k for elliptic scalar multiplication,” In AIP Conference Proceedings, (AIP Publishing, 2015), 1682, No. 1.

[7] T. Fujita, “Analytical study on Ultrafilter in Digraph: Directed Tangle and Directed Ultrafilter,” Asian Research Journal of Mathematics 21, No. 5 (2025), pp. 132-146.

[8] T. Fujita, “Linear-branch-decomposition of digraph,”Theory and Applications of Graphs, submitted (2025).

[9] H. Aljader and R. Ajeena, “The optimized Diffie-Hellman key exchange using the graphical method,” Journal of Discrete Mathematical Sciences & Cryptography, 2022.

[10] W. Kuo and M. J. Zuo, “Optimal reliability modeling: principles and applications,” John Wiley & Sons, 2003.

[11] H. Fazlollahtabar and S. T. A. Niaki, Reliability models of complex systems for robots and automation. CRC Press, 2017.

[12] S. Xiao, W. Gong, D. Towsley, Q. Zhang and T. Zhu, “Reliability analysis for cryptographic key management,” in 2014 IEEE International Conference on Communications (ICC), (IEEE, 2014), pp. 999-1004.

[13] S. Subramanian, M. Mozaffari-Kermani, R. Azarderakhsh and M. Nojoumian, “Reliable hardware architectures for cryptographic block ciphers LED and HIGHT,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 36(10), 1750-1758, (2017).

[14] A. R. Akhatov, M. Sabharwal, F. M. Nazarov, A. Rashidov, “Application of cryptographic methods to blockchain technology to increase data reliability,” In 2022 2nd International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE), (IEEE, 2022), pp. 642-647.

[15] B. J. Kadim and R. K. K. Ajeena, “Reliable Public Key Cryptosystem Type El-Gamal,” In 2023 First International Conference on Advances in Electrical, Electronics and Computational Intelligence (ICAEECI), (IEEE, 2023), pp. 1-6.

[16] B. J. Kadim and R. K. K. Ajeena, “Reliable Rabin cryptosystem using the modified decomposition method,” In AIP Conference Proceedings, 3122, No. 1, (AIP Publishing, 2024).

[17] G. Yang, “Life cycle reliability engineering,” John Wiley & Sons, 2007.

[18] A. A. AL-Ali, “Reliability of complex system”, Basra J. science, 16(1),115-112, Basra, Iraq, 1998.

Downloads

Published

2025-09-10

How to Cite

Ruma Kareem K. Ajeena, & Ban Jasim Kadim. (2025). Reliable RSA Cryptosystem Using the Path Tracing Method. Iraqi Journal of Communications and Computer Networks (IJCCN), 1(1), 52–61. https://doi.org/10.58564/IJCCN.1.1.2025.6

Issue

Section

Articles

Similar Articles

You may also start an advanced similarity search for this article.