A performance improvement of Dömösi’s cryptosystem

Domosi’s cryptosystem [2, 3] is a new stream cipher based on finite automata. The cryptosystem uses specific deterministic finite accepters as secret keys for the encryption and decryption. Though this cryptosystem has been proven to be secure against different standard attacks (see [8]), the proposed encryption algorithms in [2, 3] involve exhaustive backtracking in order to generate ciphertexts. In this research, we propose a modified encryption algorithm to improve performance of the system up to a better linear-time without effecting its security.

[1]  Renji Tao,et al.  The generalization of public key cryptosystem FAPKC4 , 1999 .

[2]  Tao Renji,et al.  Two varieties of finite automaton public key cryptosystem and digital signatures , 1986, Journal of Computer Science and Technology.

[3]  Ren-ji Tao,et al.  On Finite Automaton Public-Key Cryptosystem , 1999, Theor. Comput. Sci..

[4]  Yoshihide Igarashi,et al.  Break Finite Automata Public Key Cryptosystem , 1995, ICALP.

[5]  Ren-ji Tao,et al.  Constructing finite automata with invertibility by transformation method , 2008, Journal of Computer Science and Technology.

[6]  Ren-ji Tao,et al.  FAPKC3: A new finite automaton public key cryptosystem , 2008, Journal of Computer Science and Technology.

[7]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[8]  Renji Tao,et al.  A variant of the public key cryptosystem FAPKC3 , 1997 .