### Abstract

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(2^{8}). We show that using this special family of graphs, for any password of length m, m

Original language | English |
---|---|

Title of host publication | Computer Science Research Trends |

Publisher | Nova Science Publishers, Inc. |

Pages | 279-287 |

Number of pages | 9 |

ISBN (Print) | 9781600215186 |

Publication status | Published - 2008 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Computer Science Research Trends*(pp. 279-287). Nova Science Publishers, Inc..

**Graph based private key crypto-system.** / Touzene, Abderezak; Ustimenko, Vasyl.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*Computer Science Research Trends.*Nova Science Publishers, Inc., pp. 279-287.

}

TY - CHAP

T1 - Graph based private key crypto-system

AU - Touzene, Abderezak

AU - Ustimenko, Vasyl

PY - 2008

Y1 - 2008

N2 - 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

AB - 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

KW - Cryptography

KW - E-commerce.

KW - Graphs

KW - Symmetric encryption

KW - Virtual organizations

UR - http://www.scopus.com/inward/record.url?scp=84892224108&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892224108&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:84892224108

SN - 9781600215186

SP - 279

EP - 287

BT - Computer Science Research Trends

PB - Nova Science Publishers, Inc.

ER -