Maximality of affine group, and hidden graph cryptosystems

We describe a new algebraic-combinatorial method of public key encryption with a certain similarity to the well known Imai-Matsumoto. We use the general idea to treat vertices of a linguistic graph (see [21] and further references) as messages and use the iterative process to walk on such graph as e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2018
1. Verfasser: Ustimenko, A. A.
Format: Artikel
Sprache:English
Veröffentlicht: Lugansk National Taras Shevchenko University 2018
Schlagworte:
Online Zugang:https://admjournal.luguniv.edu.ua/index.php/adm/article/view/922
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Algebra and Discrete Mathematics

Institution

Algebra and Discrete Mathematics