Maximality of affine group, and hidden graph cryptosystems

• Published in: Algebra and Discrete Mathematics
• Date: 2005
• Main Author: Ustimenko, A.A.
• Format: Article
• Language: English
• Published: Інститут прикладної математики і механіки НАН України 2005
• Online Access: https://nasplib.isofts.kiev.ua/handle/123456789/156606
• Journal Title: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Cite this: Maximality of affine group, and hidden graph cryptosystems / A.A. Ustimenko // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 1. — С. 133–150. — Бібліогр.: 25 назв. — англ.

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 a...