| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 740 4 |
| Ultima descărcare din IBN: 2021-11-08 14:02 |
| Căutarea după subiecte similare conform CZU |
| 004.056+519.7 (1) |
| Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4173) |
| Cibernetică matematică (93) |
 SM ISO690:2012SKOBELEV, Volodymyr, SKOBELEV, Volodymyr. Finite automata over magmas: models and some applications in Cryptography. In: Computer Science Journal of Moldova, 2018, nr. 1(76), pp. 77-92. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(76) / 2018 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.056+519.7 | ||||||
| Pag. 77-92 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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. |
||||||
| Cuvinte-cheie magmas, Quasigroups, T -quasigroups, iterated hash functions, stream ciphers. |
||||||
|
|
|
|
