Strong finite automata public key cryptosystem

Abstract

Existing finite automata public key cryptosystems (FAPKC) are analyzed in this paper. Methods of breaking FAPKC by some known types of attacks are introduced. As a result, an improved FAPKC is designed in order to resist the presented types of attacks. Strong FAPKC is obtained by generating invertible nonlinear and linear automata of the suitable form.