SYMMETRIC STREAM AND FINITE AUTOMATON CIPHERSYSTEMS | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5).

The following statements are proved in the paper: 1) stream cipher-systems with the indistinguishable key stream generators are indistinguishable themselves; 2) the output function of the encryption automaton in any finite automaton ciphersystemis injective one for any its state and key being fixed; 3) the classes of the stream and of the finite automaton ciphersystems are functionally equivalent; 4) every self synchronizing with a delay r finite automaton ciphersystem with the strongly connected projections of the encryption automaton is indistinguishable from a ciphersystem built on the base of a shiftregister of the length r. Besides, a descriptive and a constructive definitions of the selfsynchronizing stream ciphersystem are introduced, and the equivalence between them are stated.