More secure on the symmetric encryption schemes based on triple vertex path graph

Shathir, Muhaimen Khudhair; Arif, Ghassan Ezzulddin; Ajeena, Ruma Kareem K.

doi:10.47974/JDMSC-1564

Open Access Research Article

More secure on the symmetric encryption schemes based on triple vertex path graph

^*Muhaimen Khudhair ShathirCorresponding authormuheiman.k.shathir@st.tu.edu.iqDepartment of Mathematics Education College for Pure Sciences University of TikritTikrit, IraqView full profile → , Ghassan Ezzulddin Arifpure.ruma.k@uobabylon.edu.iqDepartment of Mathematics Education College for Pure Sciences University of TikritBabylon, Tikrit, IraqView full profile → , Ruma Kareem K. Ajeenaruma.k.kh@ihcoedu.uobaghdad.edu.iq; scientists.ffd2019@gmail.comDepartment of Mathematics Education College for Pure Sciences University of BabylonDepartment of Computer Science College of Education for Pure Science (Ibn Al-Haitham) University of BaghdadBabil, Baghdad, IraqView full profile →

* Corresponding author · click or hover a name for details

pp. 1175–1182Vol. 26Issue 4June 2023DOI: 10.47974/JDMSC-1564 Crossmark XML

Received:: 01 Feb 2022
Accepted:: 02 Mar 2022
Published Online:: 15 Jul 2023
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-1564
Pages:: 1175–1182

Abstract

A triple vertex (TV) and triple vertex path (TVP) graph are defined as new concepts. These concepts consider the main point of this work to modify the symmetric encryption (SE) schemes and increase the security level in comparison with the previous ES schemes. In proposed ES schemes, the ciphertexts of the plaintexts are sent to the receiver entity as the TVP graph. Two study cases of the proposed TVPG-SE schemes are presented as new experimental results. The security issues of the proposed TVPG-SE schemes have been determined. The TVPG-SE schemes consider new insights for more secure communications.

Keywords

Cryptography SE schemes Graph theory TV graph TVP graph Security

Subject Classifications

68P2505E10

References

[1] M. Polak, et. al. “On the applications of extremal graph theory to coding theory and cryptography,” Electronic Notes in Discrete Mathematics, Vol. 43, pp. 329-342 (2013).
[2] J. Shruthy, and V. Maheswari, “Double Encryption, Decryption Process Using Graph Labeling Through Enhanced Vigenere Cipher,” Journal of Physics: Conference Series, IOP Publishing, Vol. 1362, No. 1 (2019).
[3] W. Zhang, “An Image Encryption Algorithm Based on Random Hamiltonian Path,” Entropy, Vol. 22, No. 1, pp. 73 (2020).
[4] R. Ajeena, “The soft graphic integer sub-decomposition method for elliptic scalar multiplication,” Journal of Discrete Mathematical Sciences and Cryptography, Vol. 24, No 6 pp. 1751-1765 (2021).
[5] K. Aljamaly, and R. Ajeena, “The elliptic scalar multiplication graph and its application in elliptic curve cryptography,” Journal of Discrete Mathematical Sciences and Cryptography, Vol. 24, No 6 pp. 1793-1807 (2021).
[6] H. Ibrahim, Raja’I. Aldiabat, and Sharmila Karim “Butterfly Triple System Algorithm Based on Graph Theory,” Journal of Information & Communication Technology, Vol. 21, No. 1, (2022).
[7] Hoffstein, Jeffrey, et. al. An introduction to mathematical cryptography. Vol. 1. New York: springer (2008).

Views: 159Downloads: 4Citations: 1