A randomized algorithm to finite automata public key cryptosystem

DOI10.1007/3-540-58325-4_237MaRDI QIDQ4525765zbMATH OpenFDO

Authors Yoshihide Igarashi, Feng Bao

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_237

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Randomized algorithms (68W20) Cryptography (94A60)

Recommendations

• Cryptanalysis on a finite automaton public key cryptosystem
• Two varieties of finite automaton public key cryptosystem and digital signatures
• Modified finite automata public key cryptosystem
• Finite Automata and Application to Cryptography
• Break finite automata public key cryptosystem

Cited in

(9)

• Increasing ranks of linear finite automata and complexity of FA public key cryptosystem
• Cryptanalysis on a finite automaton public key cryptosystem
• On finite automaton public-key cryptosystem
• Input-trees of finite automata and application to cryptanalysis
• Two varieties of finite automaton public key cryptosystem and digital signatures
• A novel cryptosystem based on Gluškov product of automata
• Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
• Modified finite automata public key cryptosystem
• Break finite automata public key cryptosystem

This page was built for publication: A randomized algorithm to finite automata public key cryptosystem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525765)