Two varieties of finite automaton public key cryptosystem and digital signatures

DOI10.1007/BF02943296zbMATH Open0614.94005MaRDI QIDQ1820751FDOQ1820751

Shi-Hua Chen, Tao Renji

Publication date: 1986

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

Recommendations

• On finite automaton public-key cryptosystem
• Cryptanalysis on a finite automaton public key cryptosystem
• scientific article; zbMATH DE number 1555990
• Finite Automata and Application to Cryptography
• scientific article; zbMATH DE number 1498328
• scientific article; zbMATH DE number 1304284
• ABOUT 2-CASCADE FINITE AUTOMATA CRYPTOGRAPHIC GENERATORS AND THEIR CRYPTANALYSIS
• Finite automata in cryptography
• scientific article; zbMATH DE number 3902047
• Break finite automata public key cryptosystem

zbMATH Keywords

digital signaturesfinite automatasecuritypublic-key cryptosystemsecrecy systemsfactoring matrix polynomials over finite fieldsprivacy systemsweak inverses of nonlinear finite automata

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic theory of languages and automata (68Q70) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• Algebraic coding theory
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Title not available (Why is that?)
• Factoring Polynomials Over Large Finite Fields
• Title not available (Why is that?)
• Embedding cryptographic trapdoors in arbitrary knapsack systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two varieties of finite automaton public key cryptosystem and digital signatures
• A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD
• Trapdoor knapsacks without superincreasing structure
• On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A GENERALIZATION OF THE KNAPSACK ALGORITHM USING GALOIS FIELDS

Cited In (11)

• Decomposing a kind of weakly invertible finite automata with delay 2
• Constructing finite automata with invertibility by transformation method
• The generalization of public key cryptosystem FAPKC4
• Input-trees of finite automata and application to cryptanalysis
• Two varieties of finite automaton public key cryptosystem and digital signatures
• Break Finite Automata Public Key Cryptosystem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A family of weak keys in HFE and the corresponding practical key-recovery
• On finite automaton public-key cryptosystem
• Title not available (Why is that?)

Uses Software

• McEliece

This page was built for publication: Two varieties of finite automaton public key cryptosystem and digital signatures

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