On finite automaton public-key cryptosystem
From MaRDI portal
Publication:1575853
DOI10.1016/S0304-3975(99)00070-5zbMATH Open0956.94011OpenAlexW2076184951MaRDI QIDQ1575853FDOQ1575853
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00070-5
Recommendations
- Cryptanalysis on a finite automaton public key cryptosystem
- scientific article; zbMATH DE number 1498328
- scientific article; zbMATH DE number 1555990
- scientific article; zbMATH DE number 1304284
- Finite automata in cryptography
- Finite Automata and Application to Cryptography
- Two varieties of finite automaton public key cryptosystem and digital signatures
- Break finite automata public key cryptosystem
- A one-key cryptosystem based on a finite nonlinear automaton
Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)
Cited In (11)
- The generalization of public key cryptosystem FAPKC4
- A novel cryptosystem based on Gluškov product of automata
- Finite Automata and Application to Cryptography
- Input-trees of finite automata and application to cryptanalysis
- Two varieties of finite automaton public key cryptosystem and digital signatures
- Homomorphic encryption for finite automata
- CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY
- Title not available (Why is that?)
- A one-key cryptosystem based on a finite nonlinear automaton
- Cryptanalysis on a finite automaton public key cryptosystem
- A Cryptosystem Based on the Composition of Reversible Cellular Automata
This page was built for publication: On finite automaton public-key cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575853)
