Two varieties of finite automaton public key cryptosystem and digital signatures

  • Tao Renji 
  • Chen Shihua 


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


Digital Signature Match Pair Matrix Polynomial Finite Automaton Galois Field 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1986

Authors and Affiliations

  • Tao Renji 
    • 1
  • Chen Shihua 
    • 1
  1. 1.Institute of SoftwareAcademia SinicaBeijingChina

Personalised recommendations