Finite automata in cryptography
From MaRDI portal
Publication:5146196
zbMATH Open1468.68086MaRDI QIDQ5146196FDOQ5146196
Authors: G. P. Agibalov
Publication date: 25 January 2021
Full work available at URL: http://mathnet.ru/eng/pdm147
Recommendations
Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)
Cites Work
- Title not available (Why is that?)
- Loosening the KNOT.
- Two varieties of finite automaton public key cryptosystem and digital signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stream and finite automaton ciphersystems
- Symmetric stream and finite automaton ciphersystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The method for messages automatic encryption
Cited In (27)
- A Haskell implementation of an attack on Dömösi's cryptosystem
- On the asymptotic normality of the frequencies of letters in a multicyclic sequence
- Enumeration of cryptarithms using deterministic finite automata
- Finite Automata and Application to Cryptography
- Input-trees of finite automata and application to cryptanalysis
- Symmetric stream and finite automaton ciphersystems
- A novel cryptosystem based on finite automata without outputs
- Stream and finite automaton ciphersystems
- On the number of ones in the cycle of multicyclin sequence determined by Boolean function
- Finite State Machine Modelling of Cryptographic Systems in Loops
- Title not available (Why is that?)
- Two varieties of finite automaton public key cryptosystem and digital signatures
- Homomorphic encryption for finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- CRYPTAUTOMATA WITH FUNCTIONAL KEYS
- CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY
- Finite automata over magmas: models and some applications in cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cryptanalysis on a finite automaton public key cryptosystem
- On finite automaton public-key cryptosystem
- Cryptography with asynchronous logic automata
- Zakrevskij's cipher based on reconfigurable FSM
- Automata over abstract finite quasigroups
This page was built for publication: Finite automata in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146196)