Finite automata over magmas: models and some applications in Cryptography
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 resolv...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2018-05-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v26-n1/v26-n1-(pp77-92).pdf |
| _version_ | 1828153236552417280 |
|---|---|
| author | Volodymyr V. Skobelev Volodymyr G. Skobelev |
| author_facet | Volodymyr V. Skobelev Volodymyr G. Skobelev |
| author_sort | Volodymyr V. Skobelev |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T22:23:26Z |
| format | Article |
| id | doaj.art-0fa4e96c5d114907af6142b1dc8d9eae |
| institution | Directory Open Access Journal |
| issn | 1561-4042 |
| language | English |
| last_indexed | 2024-04-11T22:23:26Z |
| publishDate | 2018-05-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-0fa4e96c5d114907af6142b1dc8d9eae2022-12-22T03:59:57ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422018-05-01261(76)7792Finite automata over magmas: models and some applications in CryptographyVolodymyr V. Skobelev0Volodymyr G. Skobelev1V.M. Glushkov Institute of Cybernetics of NAS of Ukraine, 40 Glushkova ave., Kyiv, Ukraine, 03187V.M. Glushkov Institute of Cybernetics of NAS of Ukraine, 40 Glushkova ave., Kyiv, Ukraine, 03187In 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.http://www.math.md/files/csjm/v26-n1/v26-n1-(pp77-92).pdfmagmasquasigroups$T$-quasigroupsiterated hash functionsstream ciphers |
| spellingShingle | Volodymyr V. Skobelev Volodymyr G. Skobelev Finite automata over magmas: models and some applications in Cryptography Computer Science Journal of Moldova magmas quasigroups $T$-quasigroups iterated hash functions stream ciphers |
| title | Finite automata over magmas: models and some applications in Cryptography |
| title_full | Finite automata over magmas: models and some applications in Cryptography |
| title_fullStr | Finite automata over magmas: models and some applications in Cryptography |
| title_full_unstemmed | Finite automata over magmas: models and some applications in Cryptography |
| title_short | Finite automata over magmas: models and some applications in Cryptography |
| title_sort | finite automata over magmas models and some applications in cryptography |
| topic | magmas quasigroups $T$-quasigroups iterated hash functions stream ciphers |
| url | http://www.math.md/files/csjm/v26-n1/v26-n1-(pp77-92).pdf |
| work_keys_str_mv | AT volodymyrvskobelev finiteautomataovermagmasmodelsandsomeapplicationsincryptography AT volodymyrgskobelev finiteautomataovermagmasmodelsandsomeapplicationsincryptography |