Abstract
This paper gives two varieties of the public key cryptosystem in [1] which can also be used to implement digital signatures.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Tao Renji and Chen Shihua, A finite automaton public key cryptosystem and digital signatures,Chinese J. of Computer,8(1985), 401–409.
W. Diffie and M. Hellman, New directions in cryptography,IEEE Trans. Inform. Theory,22(1976), 644–654.
R.C. Merkle and M.E. Hellman, Hiding information and signatures in trapdoor knapsacks,IEEE Trans. Inform. Theory,24(1978), 525–530.
M. Willett, Trapdoor knapsacks without superincreasing structure,Inform. Proc. Letters,17(1983), 7–11.
A. Shamir, Embedding cryptographic trapdoors in arbitrary knapsack systems,Inform. Proc. Letters,17(1983), 77–79.
R. Cooper and W. Patterson, A generalization of the knapsack algorithm using Galois fields,Cryptologia,8(1984), 343–347.
A. Shamir, A polynomial time algorithm for breaking Merkle-Hellman crytosystems, Proc. of the 23rd Annual Symp. Zon the Foundations of Computer Science, 1982, 145–152.
L.M. Adleman, On breaking generalized knapsack public key cryptosystem, Proc. of the 15th Annual ACM Symp. on Theory of Computing, 1983, 402–412.
R.L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems,Comm. ACM,21(1978), 120–126.
W.B. Müller and W. Nöbauer, Some remarks on public-key cryptosystems,Studia Sci. Math. Hung.,16 (1981), 71–76.
H. Brändström, A public-key cryptosystem based upon equations over a finite field,Cryptologia,7(1983), 347–358.
T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, Crypto ’84.
M.R. Magyarik and N.R. Wagner, A public-key cryptosystem based on the word problem, Crypto ’84.
R.J. McEliece, A public-key cryptosystem based on algebraic coding theory, DSN Progress Report, 42-44, 1978.
Zhou Tongheng, Boolean public key cryptosystem of the second order, J. of China Inst. of Communications,5(1984), 30–37.
Tao Renji, Invertibility of finite automata, Science Press, Beijing, 1979 (in Chinese).
Tao Renji and Chen Shihua, Some properties on the structure of invertible and inverse finite automata with delay τ,Chinese J. of Computer,3(1980), 289–297.
Chen Shihua, On the structure of weak inverses of a weakly invertible linear finite automaton,Chinese J. of Computer,4(1981), 409–419.
Tao Renji, Relationship between bounded error propagation and feedforward invertibility, KEXUE TONGBAO, 27(1982), 680–682.
Tao Renji, Some results on the structure of feedforward inverses,Scientia Sinica, ser.A,27(1984), 157–162.
Chen Shihua, On the structure of (weak) inverses of an (weakly) invertible finite automaton,J. of Computer Science and Technology, 3(1986) (to appear).
Chen Shihua, On the structure of finite automata of which M′ is an (weak) inverse with delay τ,J. of Computer Science and Technology, 2(1986) (to appear).
I. Gohberg, P. Lancaster and L. Rodman, Matrix Polynomials, Academic Press, New York, 1982.
E. Berlekamp, Algebraic coding Theory, McGraw-Hill Book Co., New York, 1968.
E. Berlekamp, Factoring polynomial over large finite fields,Math. Comp.,24(1970), 713–735.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tao, R., Chen, S. Two varieties of finite automaton public key cryptosystem and digital signatures. J. of Compt. Sci. & Technol. 1, 9–18 (1986). https://doi.org/10.1007/BF02943296
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02943296