Skobelev V.V., Skobelev V.G.
Automata over abstract finite quasigroups

This paper analyzes the structure of families of automata without output that are defined by recurrence relations on abstract finite quasigroups. The expediency of their use to design iterated hash functions with sufficiently high security is justified. It is shown how some families of reversible Mealy and Moore automata can be constructed based on such families of automata without output. The expediency of using the proposed families of Mealy and Moore automata as the basis to construct mathematical models for stream ciphers is substantiated. © 2017, Springer Science+Business Media, LLC.

Keywords: automaton without output, finite quasigroup, Mealy automaton, Moore automaton, Hash functions, automaton without output, High securities, Mealy automatons, Quasigroup, Quasigroups, Recurrence relations, Stream Ciphers, Automata theory

Cite:
Skobelev V.V., Skobelev V.G. (2017). Automata over abstract finite quasigroups. Cybernetics and Systems Analysis, 53 (5), 14-21. doi: https://doi.org/10.1007/s10559-017-9968-9 http://jnas.nbuv.gov.ua/article/UJRN-0000754480 [In Russian].