Two varieties of finite automaton public key cryptosystem and digital signatures
Recall that in a public-key cryptosystem (PKCS) each user has a public encryption algorithm E and a secret decryption algorithm D such that D is NP-hard to compute from E. Of course, there are many NP-hard cryptosystems which are easy to penetrate so crypto-complexity is clearly inequivalent to computational complexity. I.e., secure secrecy systems must not be based on NP-hardness alone. There are many ways to implement a PKCS with varying degrees of security; e.g., by using a trapdoor word problem, knapsack or factorization. The autors' scheme, using finite automata theory, is based on the extreme difficulty, in general, of finding weak inverses of nonlinear finite automata and of factoring matrix polynomials over finite fields. Since E can be constructed to be an inverse of D, the authors' cryptosystems can be used to implement digital signatures. They claim that their type of PKCS is secure, easy to implement and uses a relatively small public key in size, since it is a sequential or stream PKCS. As yet, there is no effective method to estimate a sharp lower bound on the computing time and storage requirements to determine weak inverses of nonlinear finite automata.
- 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
- A GENERALIZATION OF THE KNAPSACK ALGORITHM USING GALOIS FIELDS
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD
- Algebraic coding theory
- Embedding cryptographic trapdoors in arbitrary knapsack systems
- Factoring Polynomials Over Large Finite Fields
- scientific article; zbMATH DE number 3837370 (Why is no real title available?)
- scientific article; zbMATH DE number 3910294 (Why is no real title available?)
- scientific article; zbMATH DE number 3934412 (Why is no real title available?)
- scientific article; zbMATH DE number 3986647 (Why is no real title available?)
- scientific article; zbMATH DE number 3748927 (Why is no real title available?)
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- New directions in cryptography
- On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\)
- Trapdoor knapsacks without superincreasing structure
- Two varieties of finite automaton public key cryptosystem and digital signatures
- Decomposing a kind of weakly invertible finite automata with delay 2
- 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
- Constructing finite automata with invertibility by transformation method
- A family of weak keys in HFE and the corresponding practical key-recovery
- scientific article; zbMATH DE number 1304284 (Why is no real title available?)
- scientific article; zbMATH DE number 1555990 (Why is no real title available?)
- Break finite automata public key cryptosystem
- Finite automata in cryptography
- The generalization of public key cryptosystem FAPKC4
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)
