Geodesic
Stream and finite automaton ciphersystems
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 21-24.

Voir la notice de l'article provenant de la source Math-Net.Ru

The following statements proved by the author are presented in the paper: 1) the classes of the stream and of the finite automaton ciphersystems are functionally equivalent (Theorem 1); 2) every selfsynchronizing with a delay $\tau$ finite automaton ciphersystem with the strongly connected projections of the decryption automaton is not differed from a ciphersystem built on the base of a shiftregister of the length $\tau$ (Theorem 3). Besides, a descriptive and a constructive definitions of the selfsynchronizing stream ciphersystem are introduced, and the equivalence between them are stated (Theorem 2). 
@article{PDM_2009_10_a10,
     author = {I. V. Pankratov},
     title = {Stream and finite automaton ciphersystems},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {21--24},
     publisher = {mathdoc},
     number = {10},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a10/}
}
TY  - JOUR
AU  - I. V. Pankratov
TI  - Stream and finite automaton ciphersystems
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 21
EP  - 24
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_10_a10/
LA  - ru
ID  - PDM_2009_10_a10
ER  - 
%0 Journal Article
%A I. V. Pankratov
%T Stream and finite automaton ciphersystems
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 21-24
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2009_10_a10/
%G ru
%F PDM_2009_10_a10
I. V. Pankratov. Stream and finite automaton ciphersystems. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 21-24. http://geodesic.mathdoc.fr/item/PDM_2009_10_a10/

[1] Pankratov I. V., “K opredeleniyu ponyatiya samosinkhroniziruyuschegosya potochnogo shifra”, Vestnik Tomskogo gosuniversiteta. Prilozhenie, 2007, no. 23, 114–117