Abstract
This paper reviews some works on finite automaton one-key cryptosystems and related topics such as autonomous finite automata and Latin arrays.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
D.A. Huffman, Canonical forms for information-lossless finite-state logical machines, IRE Trans. on Circuit Theory, 6(1959), special supplement, 41–59.
J.E. Savage, Some simple self-synchronizing digital data scrambles, Bell System Technical J., 46(1967), no.2, 449–487.
F.P. Preparata, Convolutional transformation and recovery of binary sequences, IEEE Trans. on Computers, 17(1968), no.7, 649–655.
S.R. Reddy and M. J. Ashjaee, A class of serial cyphers, in Proceedings of the 1975 Conference on Information Sciences and Systems, 396–400.
A. Ecker, Abstrakte Kyptographische Maschinen, Angewandte Informatik, 1975, no.5, 201–295.
Tao Renji, Invertibility of Finite Automata, Science Press, Beijing, 1979.
Tao Renji, Relationship between bounded error propagation and feedforward invertibility, Kexue Tongbao, 27(1982), no.6, 680–682; Chinese Edition, 27(1982), no.7, 406–408.
Tao Renji, Some results on the structure of feedforward inverses, Scientia Sinica (ser.A), 27(1984), no.2, 157–162; Chinese Edition, 26(1983), no. 12, 1073–1078.
Chen Shihua and Tao Renji, Invertibility of quasi-linear finite automata, Advances in Cryptology-CHINACRYPT'92, 77–86, Science Press, Beijing, 1992.
Tao Renji, Cryptology and mathematics, Nature Journal, 7(1984), no.7, 527–534.
Yan Zhanqing and Zuou Tongheng, The implementation of a FA(finite automaton) cryptosystem, Computer Research and Development, 22(1985), no.3, 29–35, 59.
Qi Yulu,Chen Shihua and Tao Renji, A finite automaton cryptosystem and its software implementation, International Conference on Computer and Communications Proceedings, 550–557, Beijing, October 1986.
Tao Renji and Chen Shihua, A finite automaton public key cryptosystem and digital signatures, Chinese J. of Computers, 8(1985), 401–409.
Tao Renji and Chen Shihua, Two varieties of finite automaton public key cryptosystem and digital signatures, J. of Computer Science and Technology, 1(1986), 9–18.
Tao Renji and Chen Shihua, An implementation of identity-based cryptosystems and signature schemes by finite automaton public key cryptosystems, Advances in Cryptology-CHINACRYPT'92, 87–104, Science Press, Beijing, 1992.
Chen Shihua and Tao Renji, On the decision of invertible finite automata with delay Ï„ and Ï„-inverses, Institute of Computing Technology, Academia Sinica, 1967.
Tao Jen-chi(Tao Renji), Invertible linear finite automata, Scientia Sinica, 16(1973), no.4, 565–581; Chinese Edition, 16(1973), no.4, 454–467.
J.L. Massey and M.K. Sain, Inverse of linear sequential circuits, IEEE Trans. on Computer, 17(1968), no.4, 330–337.
Zhu Xinjie, On the structure of binary feedforward inverses with delay 2, J. of Computer Science and Technology, 4(1989), no.2, 163–171.
Bao Feng, Some results of self-synchronous invertibility and feedforward inverses, thesis, Institute of Software, Academia Sinica, 1986.
Tao Renji and Chen Shihua, On cryptosystems without error propagation, Proceedings of the 3rd National Colloquium on Cryptology, 16–20, Xian, 1988.
Tao Renji and Chen Shihua, Enumeration of Latin arrays (I) — case n ≤ 3, Science in China, ser.A, 33(1990), no.12, 1430–1438; Chinese Edition, ser.A, 33(1990), no.8, 803–809.
Tao Renji and Chen Shihua, Enumeration of Latin arrays (II) — case n = 4, κ ≤ 4, Science in China, ser.A, 34(1991), no.1, 20–29; Chinese Edition, ser.A, 33(1990), no.9, 930–937.
He Mingqiu, Enumeration of involution Latin arrays, thesis, Institute of Software, Academia Sinica, 1991.
Tao Renji, An application of (4,4)-Latin arrays to cryptography, Chinese J. of Computers, 14(1991), no.6, 423–431.
Tao Renji and Chen Shihua, A generation method for a kind of linear independent Latin arrays, presented at CHINACRYPT'90, Beijing, December 1990.
Tao Renji and Chen Shihua, Generation of some linear independent permutations and involutions, presented at CHINACRYPT'90, Beijing, December 1990.
Tao Renji, Linear feedback shift register sequences, Computer Application and Applied Mathematics, 1975, no.11, 21–51.
Tao Renji, Output sequences of autonomous shift registers, presented at the Workshop on Pseudo Codes, Huangshan, July 1977.
Tao Renji, A survey of invertibility of finite automata, presented at the Workshop on Pseudo Codes, Huangshan, July 1977.
Tao Renji and Chen Shihua, Some properties on the structure of invertible and inverse finite automata with delay τ, Chinese J. of Computers, 3(1980), no.4, 289–297.
Chen Shihua, On the structure of inverses of a weakly invertible linear finite automaton, Chinese J. of Computers, 4(1981), no.6, 409–419.
Zuou Shanyou, On the weakly invertibility of type I abelian FGHSS, Chinese J. of Computers, 5(1982), no.3, 220–221.
Tao Renji, Introduction to Automata Theory, series of computer science, Science Press, Beijing, 1986.
Chen Shihua, On the structure of finite automata of which M′ is an (weak) inverse with delay τ, J. of Computer Science and Technology, 1(1986), no.2, 54–59.
Chen Shihua, On the structure of (weak) inverses of an (weakly) invertible finite automaton, J. of Computer Science and Technology, 1(1986), no.3, 92–100.
Chen Shihua and Tao Renji, The structure of weak inverses of a finite automaton with bounded error propagation, Kexue Tongbao, 32(1987), no.10, 713–714; Chinese-Edition, 31(1986), no.20, 1594–1595; full paper in Advances in Chinese Computer Science, Vol.1, 205–211, World Scientific, Singapore,1988.
Tao Renji, Some mathematical problems in cryptology, Chinese Quarterly J. of Mathematics, 2(1987), no.1, 73–90.
Tao Renji, Invertibility of linear finite automata over a ring, Automata,Languages and Programming, Lecture Notes in Computer Science 317, 489–501, Springer-Verlag, 1988.
Bao Feng, Limited error-propagation, self-synchronization and finite input memory FSM as weak inverses, Advances in Chinese Computer Science, Vol.3, 1–24, World Scientific, Singapore, 1991.
Lü Shuzhi, Some results on the invertibility of linear finite automata over a ring, Chinese J. of Computers, 14(1991), no.8, 570–578.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Renji, T. (1994). On finite automaton one-key cryptosystems. In: Anderson, R. (eds) Fast Software Encryption. FSE 1993. Lecture Notes in Computer Science, vol 809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58108-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-58108-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58108-6
Online ISBN: 978-3-540-48456-1
eBook Packages: Springer Book Archive