Automata-based Symmetric-key Cryptosystems
| dc.contributor.author | Skeen, Luke | |
| dc.contributor.department | fi=Matematiikan ja tilastotieteen laitos|en=Department of Mathematics and Statistics| | |
| dc.contributor.faculty | fi=Matemaattis-luonnontieteellinen tiedekunta|en=Faculty of Science| | |
| dc.contributor.studysubject | fi=Matematiikka|en=Mathematics| | |
| dc.date.accessioned | 2021-06-02T21:01:43Z | |
| dc.date.available | 2021-06-02T21:01:43Z | |
| dc.date.issued | 2021-05-30 | |
| dc.description.abstract | Three symmetric-key cryptosystems based on different types of finite automata are studied in this thesis. One is a block cipher based on extended Mealy machines (a type of automaton with output) which was invented by Marc Gysin in 1995. The other two are block ciphers which were invented by Pál Dömösi and Géza Horváth in 2015: both are based on semiautomata (a type of automaton without initial and final states); however, one of them uses Gluškov products (a type of semiautomaton whose components are other, interconnected semiautomata). | |
| dc.format.extent | 42 | |
| dc.identifier.olddbid | 168949 | |
| dc.identifier.oldhandle | 10024/152072 | |
| dc.identifier.uri | https://www.utupub.fi/handle/11111/22814 | |
| dc.identifier.urn | URN:NBN:fi-fe2021060232816 | |
| dc.language.iso | eng | |
| dc.rights | fi=Julkaisu on tekijänoikeussäännösten alainen. Teosta voi lukea ja tulostaa henkilökohtaista käyttöä varten. Käyttö kaupallisiin tarkoituksiin on kielletty.|en=This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.| | |
| dc.rights.accessrights | suljettu | |
| dc.source.identifier | https://www.utupub.fi/handle/10024/152072 | |
| dc.subject | symmetric-key cryptography, finite automata, semiautomata, Mealy machine, extended Mealy machine | |
| dc.title | Automata-based Symmetric-key Cryptosystems | |
| dc.type.ontasot | fi=Pro gradu -tutkielma|en=Master's thesis| |
Tiedostot
1 - 1 / 1