Maximality of affine group, and hidden graph cryptosystems

• Дата: 2018
• Автор: Ustimenko, A. A.
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2018
• Теми: Data and communication security; e-commerce; Public Key Cryptography; Private Key Encryption
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/922
• Назва журналу: Algebra and Discrete Mathematics

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