Tao Renji
Tao Renji is the Chinese cryptographer who originally developed the idea of
using cellular automata to perform public key cryptography in the 1980s.
Tao Renji's home page.
The text at this site reads simply:
Prof. TAO Renji and his students are doing research on the invertibility of
finite automata. They are interested in applying the related theoretical results
to publickey cryptology and digital signatures.
Bibliography
 Renji TAO and Shiuha CHEN: "A Finite Automata Public Key Cryptosystems and Digital Signature", Chinese Journal of Computers v. 8, 1985, pp 401409 (in Chinese);
 Renji TAO and Shiuha CHEN: "Two Varieties of Finite Automata Public Key Cryptosystems and Digital Signature", Journal of Computer Science and Technology v. 1, 1986, pp 918 (in Chinese);
 Renji TAO and Shiuha CHEN: "An implementation of identitybased Cryprosystems and Signature Schemes by Finite Automaton Public Key Cryptosystems", Advances in Cryptography, CHINACRYPT '92, Bejing: Science Press, 1992, pp 87104 (in Chinese);
 Renji TAO and Shiuha CHEN: "Note on Finite Automaton Public Key Cryptosystems", Advances in Cryptography, CHINACRYPT '94, Xidian, China, 1115 Nov. 1994 (in Chinese);
 Renji TAO and Shiuha CHEN: "Generating a kind of nonlinear finite automata with invertibility by transformation method", Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing: Technical Report ISCASLCS9505, 1995 (in Chinese);
 Renji TAO: "Invertibility of Finite Automata", Science Press, 1979, Beijing. (in Chinese);
 Renji TAO: "Invertibility of linear finite automata over a ring", in Proc. of ICALP'88, LNCS 317, SpringerVerlag, 1988, pp. 489501;
 Renji TAO: "On Finite Automaton OneKey Cryptosystems", Fast Software Encryption Cambridge Security Workshop., Springer Verlang, 1994, pp. 135148;
 Renji TAO: "On RaRb transformation and inversion of compound finite automaton", Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing: Technical Report ISCASLCS9510, 1995 (in Chinese);
 Renji TAO: "Finite Automata, Latin arrays, and Cryptography", Institute of Software, Academia Sinica, Beijing (unpublished);
 Papua Guam: "Cellular Automaton Public Key Cryptosystems", Complex Systems, v.1 1987, pp 5156;
 H. Guan: "An analysis of the Finite Automata Public Key Algorithm", CHINACRYPT '94, Xidian, China, 1115 Nov. 1994, pp 120126 (in Chinese);
 WANG Hao: "On weak invertability of nonlinear finite automata", Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080;
 Feng Bao and Yoshihide Igarashi: "Break Finite Automata Public Key Cryptosystem", ICALP Lecture Notes in Computer Science, 1995, p.147158;
 Feng Bao and Yoshihide Igarashi: "A Randomized Algorithm to Finite Automata Public Key Cryptosystem", 5th International Symposium, ISAAC '94: 678686;
 Feng Bao, Robert H. Deng, Xiang Gao, Yoshihide Igarashi: "Modified Finite Automata Public Key Cryptosystem"  FAPKC research publication  download;
 Feng Bao, Yoshihide Igarashi, X. Yu: "Some results on decomposition of WIFA", IEICE Trans. on Information and Systems, Vol. E79D, No. 1, pp. 17;
 Feng Bao, Xiang Gao: "Decomposition of binary invertible finite automata", Chinese Journal of Computers, Vol. 17, No. 5, 1994, pp.330337 (in Chinese);
 J. Li, Xiang Gao: "Realization of finite automata public key cryptosystem and digital signature", in Proc. of the Second National Conference on Cryptography, CRYPTOCHINA'92, pp. 110115 (in Chinese);
 ZangDuo Dai, et al: "Weak invertibility of finite automata and cryptanalysis on FAPKC", Asiacrypt '98  page 227;
 A. Salomaa: "PublicKey Cryptography", EATCS Monographs on Theoretical Computer Science, Vol. 23, SpringerVerlag, 1990;
 Bruce Schneier: "Applied Cryptography, Second Edition", p. 500, Wiley, 1996.
