Two varieties of finite automaton public key cryptosystem and digital signatures

This paper gives two varieties of the public key cryptosystem in [1] which can also be used to implement digital signatures.

[1]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[2]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[3]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[4]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[5]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[6]  S Hen.  SOME PROPERTIES ON THE STRUCTURE OF INVERTIBLE AND INVERSE FINITE AUTOMATA WITH DELAY τ , 1980 .

[7]  R Tao.  RELATIONSHIP BETWEEN BOUNDED ERROR PROPAGATION AND FEEDFORWARD INVERTIBILITY , 1982 .

[8]  P. Lancaster,et al.  Factorization of selfadjoint matrix polynomials with constant signature , 1982 .

[9]  Adi Shamir,et al.  A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1984, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  A. Shamir.  A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1982, FOCS 1982.

[11]  Hugo Brändström.  A Public-Key Cryptosystem Based upon Equations over a Finite Field , 1983, Cryptologia.

[12]  Michael Willett.  Trapdoor Knapsacks Without Superincreasing Structure , 1983, Inf. Process. Lett..

[13]  Adi Shamir.  Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems , 1983, Inf. Process. Lett..

[14]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[15]  Leonard M. Adleman,et al.  On breaking generalized knapsack public key cryptosystems , 1983, STOC.

[16]  R Tao.  SOME RESULTS ON THE STRUCTURE OF FEEDFORWARD INVERSES , 1984 .

[17]  RODNEY COOPER,et al.  A Generalization of the Knapsack Algorithm Using Galois Fields , 1984, Cryptologia.

[18]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[19]  Neal R. Wagner,et al.  A Public Key Cryptosystem Based on the Word Problem , 1985, CRYPTO.

[20]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[21]  Chen Shihua.  On the structure of finite automata of whichM′ is an (weak) inverse with delay τ , 1986 .

[22]  陈世华.  On the Structure of Finite Automata of Which M Is an(Weak)Inverse with Delay τ , 1986 .

[23]  Shihua Chen.  On the structure of (weak) inverses of an (weakly) invertible finite automaton , 2008, Journal of Computer Science and Technology.