Modification of Finite Automata Public Key Cryptosystem
Siranush Chopuryan, Gevorg Margarov
Journal of Information Security Research, Vol. 1, No. 2, 2010.
DOI: 
Link: http://www.dline.info/jisr/fulltext/v1n2/1.pdf
Abstract:
Existing finite automata public key cryptosystems (FAPKC) are analyzed in this paper. General types of cryptanalytic attacks on FAPKC are discussed and methods of breaking FAPKC by some known types of attacks are introduced. The times needed to perform the usual cryptanalytic attacks on FAPKC are calculated, in order to estimate processing complexity of those attacks. The contrastive analysis of performed attacks processing complexities is made to compare the vulnerabilities of FAPKC against discussed attacks. 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.