Cryptographic Algorithms on Groups and Algebras


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

We analyze algorithms for open construction of a key on some noncommutative group. Algorithms of factorization and decomposition for associative algebras (of small dimension) are considered. A survey of applications (in particular, in cryptography) of so-called “hidden matrices” is given.

About the authors

A. S. Kuzmin

Academy of Cryptography of Russia

Email: vtmarkov@yandex.ru
Russian Federation, Moscow

V. T. Markov

Moscow State University

Author for correspondence.
Email: vtmarkov@yandex.ru
Russian Federation, Moscow

A. A. Mikhalev

Moscow State University

Email: vtmarkov@yandex.ru
Russian Federation, Moscow

A. V. Mikhalev

Moscow State University

Email: vtmarkov@yandex.ru
Russian Federation, Moscow

A. A. Nechaev

Moscow State University

Email: vtmarkov@yandex.ru
Russian Federation, Moscow


Copyright (c) 2017 Springer Science+Business Media New York

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies