References 399
80. M. C. Paull and S. H. Unger, Minimizing the number of states in incompletely
specified sequential functions, IRE Transactions on Electronic Computers,
8(1959), 356–367.
81. Y. L. Qi, S. H. Chen, and R. J. Tao, A finite automaton cryptosystem and
its software implementation, Computer Research and Development, 24(1987),
6–14. (in Chinese)
82. Z. P. Qin and H. G. Zhang, Enumeration of sequences in finite automata with
application to cryptanalysis, in Advances in Cryptology – CHINACRYPT’94,
Science Press, Beijing, 1994, 112–119. (in Chinese)
83. Z. P. Qin and H. G. Zhang, Cryptanalysis of finite automaton public key
cryptosystems, in Advances in Cryptology – CHINACRYPT’96, Science Press,
Beijing, 1996, 75–86. (in Chinese)
84. Z. P. Qin and H. G. Zhang, ALT
+
-algorithm for attacking cryptosystems,
Chinese Jounrnal of Computers, 20(1997), 546–550. (in Chinese)
85. Z. P. Qin, H. G. Zhang and X. Q. Cao, Linear primitive factorization to
the loop product of the automaton-defining function, Chinese Jounrnal of
Computers, 22(1999), 11–15. (in Chinese)
86. M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM
Jounrnal of Research and Development, 3(1959), 114–125.
87. G. N. Raney, Sequential functions, Jounrnal of the Association for Computing
Machinery, 5(1958), 177–180.
88. S. R. Reddy and M. J. Ashjaee, A class of serial cyphers, in Proceedings of
the 1975 Conference on Information Sciences and Systems, Johns Hopkins
University Press, Baltimore, 1975, 396–400.
89. R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital
signatures and public-key cryptosystems, Communications of the Association
for Computing Machinery, 21(1978), 120–126.
90. A. Salomaa, Public-key Cryptography, Springer-Verlag, Berlin, 1990.
91. J. E. Savage, Some simple self-synchronizing digital data scrambles, Bell Sys-
tem Technical Journal, 46(1967), 449–487.
92. C. E. Shannon, Communication theory of securecy systems, Bell System
Technical Journal, 28(1949), 656–716.
93. P. Smith, LUC public-key encryption, Dr.Dobb’s Journal, 18(1993), 44–49.
94. P. H. Starke, Einige Bemerkungen ¨uber nicht-deterministische Automaten,
Elektronische Informationsverarbeitung und Kybernetik, 2(1966), 61–82.
95. P. H. Starke, Abstract Automata, North-Holland Pub. Co., Amsterdan, 1972.
96. J. C. Tao (R. J. Tao), Invertible linear finite automata, Scientia Sinica,
16(1973), 565–581.
97. R. J. Tao, Linear feedback shift register sequences, Computer Application and
Applied Mathematics, 1975, No.11, 21–51. (in Chinese)
98. R. J. Tao, Invertibility of Finite Automata, Science Press, Beijing, 1979. (in
Chinese)
99. R. J. Tao, Relationship between bounded error propagation and feedforward
invertibility, Kexue Tongbao, 27(1982), 680–682.
100. R. J. Tao, Some results on the structure of feedforward inverses, Scientia
Sinica,Ser.A,27(1984), 157–162.
101. R.J. Tao, Cryptology and mathematics, Nature Journal, 7(1984), 527–534.
(in Chinese)
102. R. J. Tao, Some mathematical problems in cryptology, Chinese Quarterly
Jounrnal of Mathematics, 2
(1987), 73–90. (in Chinese)
103. R. J. Tao, Invertibility of linear finite automata over a ring, in Automata,
Languages and Programming, Lecture Notes in Computer Science 317,
Springer-Verlag, Berlin, 1988, 489–501.