We propose new multivariate cryptosystems over an n-dimensional free module over the
arithmetical ring Zm based on the idea of hidden discrete logarithm for Zm*. These …

The families of bijective transformations $ G_n $ of affine space $ K^ n $ over general
commutative ring $ K $ of increasing order with the property of stability will be constructed …

We are going to observe special algebraic Turing machines designed for different
assignments of cryptography such as classical symmetric encryption, public key algorithms …

We observe recent results on the applications of extremal graph theory to cryptography.
Classical Extremal Graph Theory contains Erdős Even Circuite Theorem and other …

The paper is devoted to the implementations of the public key algorithms based on simple
algebraic graphs A (n, K) and D (n, K) defined over the same finite commutative ring K. If K is …

Special family of non-bijective multivariate maps Fn of Zm n into itself is constructed for n= 2,
3,... and composite m. The map Fn is injective on Ωn={x| x1+ x2+... xn∈ Zm∗} and solution …

Certain families of graphs can be used to obtain multivariate polynomials for cryptographic
algorithms. In particular, in this paper, we introduce stream ciphers based on non-bijective …

Graphs of large girth of algebraic nature known in the Theory of Extremal Graphs are known
as efficient instruments for the design of construction of Low Density Parity Check Codes for …

Expanding graphs are known due to their remarkable applications to Computer Science. We
are looking for their applications to Post Quantum Cryptography. One of them is …

Discovery of q-regular forest description in terms of an infinite system of quadratic equations
over finite field Fq had an impact on the development of Graph Based Cryptography and …