Input-trees of finite automata and application to cryptanalysis

DOI10.1007/BF02948867MaRDI QIDQ1581120zbMATH OpenOpenAlexFDO

Authors Tao Renji, Shihua 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

exhaust search algorithmsfinite automatafinite automaton public key cryptosystemsinput setoutput setstochastic search algorithmsweights

Mathematics Subject Classification ID

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

Recommendations

• Finite Automata and Application to Cryptography
• On finite automaton public-key cryptosystem
• CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY
• Finite automata in cryptography
• Cryptanalysis on a finite automaton public key cryptosystem

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Cryptanalysis on a finite automaton public key cryptosystem
• Elliptic Curve Cryptosystems
• scientific article; zbMATH DE number 49145 (Why is no real title available?)
• scientific article; zbMATH DE number 1555990 (Why is no real title available?)
• Increasing ranks of linear finite automata and complexity of FA public key cryptosystem
• New directions in cryptography
• On finite automaton public-key cryptosystem
• On relations between \(R_ aR_ b\) transformation and canonical diagonal form of \(\lambda\)-matrix
• Sequential Functions
• The generalization of public key cryptosystem FAPKC4
• Two varieties of finite automaton public key cryptosystem and digital signatures

Cited in

(9)

• 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
• Upper bounds on the imbalance of discrete functions implemented by sequences of finite automata
• Concatenated Automata in Cryptanalysis of Stream Ciphers
• Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning
• scientific article; zbMATH DE number 67081 (Why is no real title available?)
• CRYPTANALYTIC CONCEPT OF FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY
• Cryptanalytical finite automaton invertibility with finite delay

Describes a project that uses

Uses Software

• McEliece

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

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