RO  EN
IMCS/Publications/CSJM/Issues/CSJM v.26, n.1 (76), 2018/

Finite automata over magmas: models and some applications in Cryptography

Authors: Volodymyr V. Skobelev, Volodymyr G. Skobelev
Keywords: magmas, quasigroups, $T$-quasigroups, iterated hash functions, stream ciphers.

Abstract

In the paper the families of finite semi-automata and reversible finite Mealy and Moore automata over finite magmas are defined and analyzed in detail. On the base of these models it is established that the set of finite quasigroups is the most acceptable subset of the set of finite magmas at resolving model problems in Cryptography, such as design of iterated hash functions and stream ciphers. Defined families of finite semi-automata and reversible finite automata over finite $T$-quasigroups are investigated in detail. It is established that in this case models time and space complexity for simulation of the functioning during one instant of automaton time can be much lower than in general case.

Volodymyr V. Skobelev
V. M. Glushkov Institute of Cybernetics of NAS of Ukraine
40 Glushkova ave., Kyiv, Ukraine, 03187
Phone: +38 066 276 85 72
E-mail:
Volodymyr G. Skobelev
V. M. Glushkov Institute of Cybernetics of NAS of Ukraine
40 Glushkova ave., Kyiv, Ukraine, 03187
Phone: +38 063 431 86 05
E-mail:

Fulltext

Adobe PDF document0.14 Mb