On the implementation of new symmetric ciphers based on non-bijective multivariate maps
Vasyl Ustimenko, Urszula Romańczuk, Aneta Wróblewska, Monika Polak, Eustrat Zhupa · Annals of Computer Science and Information Systems · 2018
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 nonbijective multivariate maps.The presented symmetric encryption algorithms are based on three families of bipartite graphs with partition sets isomorphic to K n , where K is selected as the finite commutative ring.The plainspace of the algorithm isWe describe the algorithm for the case K = Z2m , m ≥ 2. In fact, we use the relation d * d dec ≡ 1(mod 2 m-1 ), d, d dec ∈ Z