Result: CRYPTIM : Graphs as tools for symmetric encryption

Title:
CRYPTIM : Graphs as tools for symmetric encryption
Authors:
USTIMENKO, Vasyl
Source:
AAECC-14 : applied algebra, algebraic algorithms and error-correcting codes (Melbourne, 26-30 November 2001)Lecture notes in computer science. :278-286
Publisher Information:
Berlin: Springer, 2001.
Publication Year:
2001
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Codage linéaire, Linear coding, Codificación lineal, Commerce électronique, Electronic trade, Comercio electronico, Cryptage, Encryption, Cifrado, Cryptographie, Cryptography, Criptografía, Equation linéaire, Linear equation, Ecuación lineal, Méthode combinatoire, Combinatorial method, Método combinatorio, Réseau communication, Communication network, Red de comunicación, Similitude, Similarity, Similitud, Système équation, Equation system, Sistema ecuación, Sécurité, Safety, Seguridad
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dept. of Mathematics and Computing Science, University of the South Pacific, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=14047307
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.14047307
Database:
PASCAL Archive

Further Information

A combinatorial method of encryption is presented. The general idea is to treat vertices of a graph as messages and walks of a certain length as encryption tools. We study the quality of such an encryption in case of graphs of high girth by comparing the probability to guess the message (vertex) at random with the probability to break the key, i.e. to guess the encoding walk. In fact the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem. We construct special linguistic graphs of affine type whose vertices (messages) and walks (encoding tools) could be both naturally identified with vectors over GF(q), and neighbors of the vertex defined by a system of linear equations. For them the computation of walks has a strong similarity with the classical scheme of linear coding. The algorithm has been implemented and tested.