A Robust Scheme to Improving Security of Data using Graph Theory

With the incredible growth of using internet and other new telecommunication technologies, cryptography has be-come an absolute necessity for securing communications between two or more entities, particularly in the case of transferring confi-dential data. In the literature, many encryption systems have been proposed against attack threats. These schemes should normally overcome the concerns by ensuring confidentiality, integrity and authenticity of transmitted data. However, several of them have shown weaknesses in terms of security and complexity. Hence the need for a robust and powerful non-standard encryption algorithm to prevent any traditional opportunity to sniff data. In this work, we propose a new encryption system that perfectly meets the security requirements. The scheme is based essentially on the principles of graph theory which are very promising at plain text representations. Our approach proposes another use of the concept of Hamiltonian circuit and adjacency matrix using a shared key and a pseudo-random generator. After analysis of the experimental results, which were very promising, the technique was found to be both efficient and robust.

@article{Bekkaoui2020,
  title     = {A Robust Scheme to Improving Security of Data using Graph Theory},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {11},
  number    = {5},
  year      = {2020},
  publisher = {The Science and Information Organization},
  author    = {Khalid Bekkaoui and Soumia Ziti and Fouzia Omary},
  doi       = {10.14569/IJACSA.2020.0110582},
  url       = {https://doi.org/10.14569/IJACSA.2020.0110582}
}