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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have