Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC

@inproceedings{Dai1998WeakIO,
title={Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC},
author={Zongduo Dai and Dingfeng Ye and Kwok-Yan Lam},
booktitle={ASIACRYPT},
year={1998}
}

FAPKC [17, 18, 19, 20, 22] is a public key cryptosystem based weakly invertible nite 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.Â

The Invertibility Theory and Application of Quadratic Finite Automata, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing

X. M. Chen

1996

Highly Influential

18 Excerpts

FAPKC3: a new nite automaton public key cryptosystem, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing

R. J. Tao, S. H. Chen, X. M. Chen

1995

Highly Influential

18 Excerpts

Weak Invertibility of Linear Finite Automata I, Classi cation and Enumeration of Transfer Functions, SCIENCE