Graph based private key crypto-system

Abderezak Touzene, Vasyl Ustimenko

Research output: Chapter in Book/Report/Conference proceedingChapter

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(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.
Pages279-287
Number of pages9
ISBN (Print)9781600215186
Publication statusPublished - 2008

Fingerprint

Cryptography

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Touzene, A., & Ustimenko, V. (2008). Graph based private key crypto-system. In Computer Science Research Trends (pp. 279-287). Nova Science Publishers, Inc..

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

Computer Science Research Trends. Nova Science Publishers, Inc., 2008. p. 279-287.

Research output: Chapter in Book/Report/Conference proceedingChapter

Touzene, A & Ustimenko, V 2008, Graph based private key crypto-system. in Computer Science Research Trends. Nova Science Publishers, Inc., pp. 279-287.
Touzene A, Ustimenko V. Graph based private key crypto-system. In Computer Science Research Trends. Nova Science Publishers, Inc. 2008. p. 279-287
Touzene, Abderezak ; Ustimenko, Vasyl. / Graph based private key crypto-system. Computer Science Research Trends. Nova Science Publishers, Inc., 2008. pp. 279-287
@inbook{4351c38072d441f7ad76286eed1aa9be,
title = "Graph based private key crypto-system",
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(28). We show that using this special family of graphs, for any password of length m, m",
keywords = "Cryptography, E-commerce., Graphs, Symmetric encryption, Virtual organizations",
author = "Abderezak Touzene and Vasyl Ustimenko",
year = "2008",
language = "English",
isbn = "9781600215186",
pages = "279--287",
booktitle = "Computer Science Research Trends",
publisher = "Nova Science Publishers, Inc.",

}

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

SN - 9781600215186

SP - 279

EP - 287

BT - Computer Science Research Trends

PB - Nova Science Publishers, Inc.

ER -