A Robust Scheme to Improving Security of Data using Graph Theory

Bekkaoui, Khalid; Ziti, S.; Omary, Fouzia

doi:10.14569/ijacsa.2020.0110582

Cited by 2 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among the most recent works, we mention the work presented in [17], where a block cipher system has been proposed using disjoint Hamiltonian circuits to present the data as a graph. Also in [18], a double vertex graph has been suggested to encrypt a word.…”

Section: Related Workmentioning

confidence: 99%

“…The primary aim that drives the system put forward in this paper, is to propose a robust variant of the encryption scheme proposed in [17] while maintaining the performance levels. The main concept on which our approach is based is inspired by the divide-and-conquer design method, which consists in dividing an initial problem into sub-problems and then addressing every component of the resulting subset independently.…”

Section: Proposed Approachmentioning

confidence: 99%

“…The system described in this work has been designed in such a way that it takes into account the complexity of the processing that the plaintext messages are subjected to during their encryption process. Indeed, this is the objective of the contribution in this paper, which is to improve the processing of the plaintext by making it more difficult and more complex than [17], using mainly all the Hamiltonian circuits that represent the plaintext.…”

Section: Proposed Approachmentioning

confidence: 99%

“…The scheme proposed in [17] used a block of 25-characters length, which can be represented by 2 disjoint Hamiltonian circuits in a graph of order 13, given that a graph of order 13 contains 6 disjoint Hamiltonian circuits (Theorem 1). In contrast to [17], which used only 2 of the 6 circuits, the concept put forward in this approach makes use of all the disjoint Hamiltonian circuits of the graph (6 circuits), which allows the representation of blocks with 78-characters length in a single graph.…”

Section: Proposed Approachmentioning

confidence: 99%

“…Considering a message which consist of 78 characters, the formula for splitting into blocks in [17] would be as follows: 78 = 25 × 3 + 3. This means that four blocks will be transformed into four adjacency matrices.…”

Section: Proposed Approachmentioning

confidence: 99%

See 4 more Smart Citations

Data Security: A New Symmetric Cryptosystem based on Graph Theory

Bekkaoui¹,

Ziti²,

Omary³

2021

IJACSA

Self Cite

View full text Add to dashboard Cite

Sharing private data in an unsecured channel is extremely critical, as unauthorized entities can intercept it and could break its privacy. The design of a cryptosystem that fulfills the security requirements in terms of confidentiality, integrity and authenticity of transmitted data has therefore become an unavoidable imperative. Indeed, a lot of work has been carried out in this regard. Although many cryptosystems have been proposed in the published literature, it has been found that their robustness and performance vary relatively from one to another. Adopting this reflection, we address in this paper the concept of block cipher, which is a major cryptographic solution to guarantee confidentiality, by involving the properties of graph theory to represent the plaintext message. Our proposal is in fact a new symmetric encryption block cipher that proceeds by representing plaintext messages using disjoint Hamiltonian circuits and then dealing with them as an adjacency matrix in a pre-encryption phase. The proposed system relies on a particular sub-key generator that has been carefully designed to produce the encryption keys according to the specifications of the system. The obtained experimental results demonstrate that our proposed cryptosystem is robust against statistical attacks, particularly the DIEHARD test, and presents both good confusion and good diffusion.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Proposed Approachmentioning

confidence: 99%

Section: Proposed Approachmentioning

confidence: 99%

Section: Proposed Approachmentioning

confidence: 99%

Section: Proposed Approachmentioning

confidence: 99%

See 3 more Smart Citations