Two varieties of finite automaton public key cryptosystem and digital signatures
From MaRDI portal
Publication:1820751
DOI10.1007/BF02943296zbMath0614.94005MaRDI QIDQ1820751
Publication date: 1986
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
securityfinite automatadigital signaturespublic-key cryptosystemsecrecy systemsfactoring matrix polynomials over finite fieldsprivacy systemsweak inverses of nonlinear finite automata
Cryptography (94A60) Finite fields and commutative rings (number-theoretic aspects) (11T99) Algebraic theory of languages and automata (68Q70)
Related Items (8)
A family of weak keys in HFE and the corresponding practical key-recovery ⋮ Decomposing a kind of weakly invertible finite automata with delay 2 ⋮ Constructing finite automata with invertibility by transformation method ⋮ Break Finite Automata Public Key Cryptosystem ⋮ The generalization of public key cryptosystem FAPKC4 ⋮ Two varieties of finite automaton public key cryptosystem and digital signatures ⋮ Unnamed Item ⋮ Input-trees of finite automata and application to cryptanalysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding cryptographic trapdoors in arbitrary knapsack systems
- Trapdoor knapsacks without superincreasing structure
- On the structure of finite automata of which M' is a (weak) inverse with delay \(\tau\)
- Two varieties of finite automaton public key cryptosystem and digital signatures
- A GENERALIZATION OF THE KNAPSACK ALGORITHM USING GALOIS FIELDS
- A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Factoring Polynomials Over Large Finite Fields
This page was built for publication: Two varieties of finite automaton public key cryptosystem and digital signatures
