Input-trees of finite automata and application to cryptanalysis

DOI10.1007/BF02948867zbMath0976.94024OpenAlexW2065473279MaRDI QIDQ1581120

Ren-ji Tao, Shi-hua Chen

Publication date: 13 January 2002

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948867

zbMATH Keywords

weightsfinite automatastochastic search algorithmsexhaust search algorithmsfinite automaton public key cryptosystemsinput setoutput set

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Decomposing a kind of weakly invertible finite automata with delay 2 ⋮ Structure of weakly invertible semi-input-memory finite automata with delay 2. ⋮ Structure of weakly invertible semi-input-memory finite automata with delay 1

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• The generalization of public key cryptosystem FAPKC4
• Increasing ranks of linear finite automata and complexity of FA public key cryptosystem
• Cryptanalysis on a finite automaton public key cryptosystem
• On relations between \(R_ aR_ b\) transformation and canonical diagonal form of \(\lambda\)-matrix
• On finite automaton public-key cryptosystem
• Two varieties of finite automaton public key cryptosystem and digital signatures
• Sequential Functions
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: Input-trees of finite automata and application to cryptanalysis