Graph based private key crypto-system

Abderezak Touzene*, Vasyl Ustimenko

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter


Our symmetric key crypto-system is based on walks on a bipartite graph. The general idea is to treat vertices of a graph as messages and arcs of a certain length as an encryption tool. Starting from the plain text (vertex v1 of graph), we consider a one-step walk as an arc that connect vi to the next vertex vi+1 and which uses one character of the password. The adjacency matrix of this graph consists of a simple system of equations. A plain data is seen as an n-tuple in a Galois finite field GF(28). We show that using this special family of graphs, for any password of length m, m

Original languageEnglish
Title of host publicationComputer Science Research Trends
PublisherNova Science Publishers, Inc.
Number of pages9
ISBN (Print)9781600215186
Publication statusPublished - 2008


  • Cryptography
  • E-commerce.
  • Graphs
  • Symmetric encryption
  • Virtual organizations

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Graph based private key crypto-system'. Together they form a unique fingerprint.

Cite this