Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC

Authors:
Zong-Duo Dai;Ding-Feng Ye;Kwok-Yan Lam
Affiliations:
-;-;-
Venue:
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Year:
1998

Citing 3
Cited 0

Invertibility of Linear Finite Automata Over a Ring

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Break Finite Automata Public Key Cryptosystem

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Inverses of Linear Sequential Circuits

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

FAPKC [17, 18, 19, 20, 22] is a public key cryptosystem based weakly invertible finite automata. Weak invertibility of FAs is the key to understand and analyze this scheme. In this paper a set of algebraic terminologies describing FAs is developed, and the theory of weak invertibility of FAs is studied. Based on this, a cryptanalysis on FAPKC is made. It is shown that the keys proposed in [17, 18, 19, 20, 21] for FAPKCs are insecure both in encrypting and in signing.