Journal of Computer Science and Technology ›› 1986, Vol. 1 ›› Issue (1): 9-18.

Previous Articles     Next Articles

Two Varieties of Finite Automaton Public Key Cryptosystem and Digital Signatures

Tao Renji and Chen Shihua   

  1. Institute of Software, Academia Sinica, Beijing, China
  • Received:1985-03-17 Online:1986-01-10 Published:2022-01-20

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

[1] Tao Renji and Chen Shihua, A finite automaton public key cryptosystem and digital signatures,Chinese J. of Computer,8(1985), 401–409.
[2] W. Diffie and M. Hellman, New directions in cryptography,IEEE Trans. Inform. Theory,22(1976), 644–654.
[3] R.C. Merkle and M.E. Hellman, Hiding information and signatures in trapdoor knapsacks,IEEE Trans. Inform. Theory,24(1978), 525–530.
[4] M. Willett, Trapdoor knapsacks without superincreasing structure,Inform. Proc. Letters,17(1983), 7–11.
[5] A. Shamir, Embedding cryptographic trapdoors in arbitrary knapsack systems,Inform. Proc. Letters,17(1983), 77–79.
[6] R. Cooper and W. Patterson, A generalization of the knapsack algorithm using Galois fields,Cryptologia,8(1984), 343–347.
[7] 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.
[8] L.M. Adleman, On breaking generalized knapsack public key cryptosystem, Proc. of the 15th Annual ACM Symp. on Theory of Computing, 1983, 402–412.
[9] R.L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems,Comm. ACM,21(1978), 120–126.
[10] W.B. Müller and W. Nöbauer, Some remarks on public-key cryptosystems,Studia Sci. Math. Hung.,16 (1981), 71–76.
[11] H. Brändström, A public-key cryptosystem based upon equations over a finite field,Cryptologia,7(1983), 347–358.
[12] T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, Crypto ’84.<br />
[13] M.R. Magyarik and N.R. Wagner, A public-key cryptosystem based on the word problem, Crypto ’84.<br />
[14] R.J. McEliece, A public-key cryptosystem based on algebraic coding theory, DSN Progress Report, 42-44, 1978.<br />
[15] Zhou Tongheng, Boolean public key cryptosystem of the second order, J. of China Inst. of Communications,5(1984), 30–37.<br />
[16] Tao Renji, Invertibility of finite automata, Science Press, Beijing, 1979 (in Chinese).<br />
[17] 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.<br />
[18] Chen Shihua, On the structure of weak inverses of a weakly invertible linear finite automaton,Chinese J. of Computer,4(1981), 409–419.<br />
[19] Tao Renji, Relationship between bounded error propagation and feedforward invertibility, KEXUE TONGBAO, 27(1982), 680–682.<br />
[20] Tao Renji, Some results on the structure of feedforward inverses,Scientia Sinica, ser.A,27(1984), 157–162.<br />
[21] Chen Shihua, On the structure of (weak) inverses of an (weakly) invertible finite automaton,J. of Computer Science and Technology, 3(1986) (to appear).<br />
[22] 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).<br />
[23] I. Gohberg, P. Lancaster and L. Rodman, Matrix Polynomials, Academic Press, New York, 1982.<br />
[24] E. Berlekamp, Algebraic coding Theory, McGraw-Hill Book Co., New York, 1968.<br />
[25] E. Berlekamp, Factoring polynomial over large finite fields,Math. Comp.,24(1970), 713–735.
No related articles found!
Full text



No Suggested Reading articles found!

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
  Copyright ©2015 JCST, All Rights Reserved