Abstract
FAPKC4, a public key cryptosystem based on automata theory, is generalized so that component automata of compound automata in user’ s public key would not be restricted to memory finite automata. The generalized FAPKC4 can be used in encryption and implementing digital signatures as well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Diffie, W., Hellman, M., New dirrctions in cryptography,IEEE Trans. on Informotion Theory. 1976, IT-22: 644.
Tao Renji, Chen Shihua, A finite automaton puhlic key cryptosystem and digital signatures,Chinese J. of Computers (in Chinese), 1985, 8: 401.
Tao Renji, Chen Shihua, Two varietirs of finite automaton public key cryptosystem and digital signatures,J. of Computer Science and Technology. 1986. 1:9.
Tao Renji, Chen Shihua, Chen Xuemei, FAPKC3: n new finite automaton public key cryptosystem,J. of Computer Science and Technology, 1997, 12: 289.
Tao Rrnji, Chen Shihua, A variant of the public key cryptosystem FAPKC3,J. of Netwurk and Computer Applications, 1997, 20: 283.
Tao Renji, Chcn Shihua, Constructing finite automata with invertibility by transformation method,Advances in Cryptology-CHINACRYPT’98 (eds. Liu Mulan, Gang Qimin), Beijing: Science Press, 1998, 61.
Tao Renji, Chen Shihua, A note on the public key cryptosystem FAPKC3,Advances in Cryptology-CHINACRPT’ 98 (eds. Liu Mulan, Gong Qimin), Beijing: Science Press, 1998, 69.
Author information
Authors and Affiliations
About this article
Cite this article
Tao, R., Chen, S. The generalization of public key cryptosystem FAPKC4. Chin. Sci. Bull. 44, 784–790 (1999). https://doi.org/10.1007/BF02885019
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02885019