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...
Gespeichert in:
| Veröffentlicht in: | Algebra and Discrete Mathematics |
|---|---|
| Datum: | 2005 |
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | Englisch |
| Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2005
|
| Online Zugang: | https://nasplib.isofts.kiev.ua/handle/123456789/156606 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Zitieren: | Maximality of affine group, and hidden graph cryptosystems / A.A. Ustimenko // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 1. — С. 133–150. — Бібліогр.: 25 назв. — англ. |