Abstract
Finite Automata Public Key Cryptosystem (FAPKC) appeared about 10 years ago in Chinese literature. FAPKC possesses many advantageous features: it is a stream-cipher capable of high-speed operation and it has a relatively small key size. Recently, FAPKC was broken in a way that the decryption automata can be derived directly from the encryption automaton [2]. However, the break is due to an oversight of the FAPKC designers. It does not reveal any weakness in its fundamental design principle. In this paper, we describe a modified FAPKC which retains all the desirable features of the original version. However, in order to resist a similar attack as that of [2], we require that the underlying automata used in the modified FAPKC satisfy certain conditions. We describe the attack and show how the automata satisfying these conditions can be constructed easily. We also show that the modified FAPKC is secure against several other known attacks.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Bao, Y. Igarashi, “A randomized algorithm to finite automata public key cryptosystem”, in Proc. of ISAAC'94, LNCS 834, Springer-Verlag, 1994, pp. 678–686.
F. Bao, Y. Igarashi, “Break Finite Automata Public Key Cryptosystem”, in the Proc. of ICALP'95, LNCS 944, Springer-Verlag, 1995, pp. 147–158.
F. Bao, Y. Igarashi, X. Yu, “Some results on decomposition of WIFA”, IEICE Trans. on Information and Systems, Vol. E79-D, No. 1, pp. 1–7.
S. Even, “Generalized automata and their information losslessness”, in Switching Circuit Theory and Logic Design, 1962, pp. 144–147.
S. Even, “On information lossless automata of finite order”, IEEE Trans. on Electric Computer, Vol. 14, No. 4, 1965, pp. 561–569.
X. Gao, F. Bao, “Decomposition of binary invertible finite automata”, Chinese J. of Computers, Vol. 17, No. 5, 1994, pp.330–337. (in Chinese)
I. Gohberg, P. Lancaster, L. Rodman, Matrix Polynomials, Academic Press, New York.
D. A. Huffman, “Canonical forms for information-lossless finite-state logic machines”, IRE Trans. on Circuit Theory, Vol. CT-6, Special Supplements, May, 1959, pp. 41–59.
J. Li, X. Gao, “Realization of finite automata public key cryptosystem and digital signature”, in Proc. of the Second National Conference on Cryptography, CRYPTO-CHINA'92, pp. 110–115. (in Chinese)
J. L. Massey, M. K. Sain, “Inverse of linear sequential circuits”, IEEE Trans. on Computers, Vol. 17, No. 4, 1968, pp. 330–337.
V. Niemi, “Cryptology: Language-theoretic aspects”, Handbook of Formal Languages, Vol. 2, Ed. G. Rozenberg and A. Salomaa, Springer-Verlag, Berlin, 99. 507–524, 1997.
A. Salomaa, Public-Key Cryptography, EATCS Monographs on Theoretical Computer Science, Vol. 23, Springer-Verlag, 1990.
B. Schneier, “Applied Cryptography”, second edition, 1996.
R. Tao, Invertibility of Finite Automata, Science Press, 1979, Beijing. (in Chinese)
R. Tao, S. Chen, “Finite automata public key cryptosystem and digital signature”, Computer Acta, Vol. 8, No. 6, 1985, pp. 401–409. (in Chinese)
R. Tao, S. Chen, “Two varieties of finite automata public key cryptosystem and digital signature”, J. of Computer Science and Technology, Vol. 1, No. 1, pp. 9–18.
R. Tao, “Invertibility of linear finite automata over a ring“, in Proc. of ICALP'88, LNCS 317, Springer-Verlag, 1988, pp. 489–501.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, F., Deng, R.H., Gao, X., Igarashi, Y. (1998). Modified Finite Automata Public Key Cryptosystem. In: Okamoto, E., Davida, G., Mambo, M. (eds) Information Security. ISW 1997. Lecture Notes in Computer Science, vol 1396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030411
Download citation
DOI: https://doi.org/10.1007/BFb0030411
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64382-1
Online ISBN: 978-3-540-69767-1
eBook Packages: Springer Book Archive