Geodesic
Automaton identification in the class of Sprott's automata
Prikladnaâ diskretnaâ matematika, no. 1 (2008), pp. 131-135.

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

The problem of automaton identification in the class of Sprott's automata over the finite ring $\mathbf Z_p^k=(\mathbf Z_p^k,\oplus,\circ)$ is solved. The estimation problem of the solution complexity is considered as a necessary characteristics for computational security of a stream cipher determined by the Sprott's automaton when information stream is interpreted as some control. It is shown that in a Sprott's automata subclass the problem is solved by carrying out multiple experiments with automaton. 
@article{PDM_2008_1_a21,
     author = {V. A. Sukhinin and V. G. Skobelev},
     title = {Automaton identification in the class of {Sprott's} automata},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {131--135},
     publisher = {mathdoc},
     number = {1},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2008_1_a21/}
}
TY  - JOUR
AU  - V. A. Sukhinin
AU  - V. G. Skobelev
TI  - Automaton identification in the class of Sprott's automata
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2008
SP  - 131
EP  - 135
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2008_1_a21/
LA  - ru
ID  - PDM_2008_1_a21
ER  - 
%0 Journal Article
%A V. A. Sukhinin
%A V. G. Skobelev
%T Automaton identification in the class of Sprott's automata
%J Prikladnaâ diskretnaâ matematika
%D 2008
%P 131-135
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2008_1_a21/
%G ru
%F PDM_2008_1_a21
V. A. Sukhinin; V. G. Skobelev. Automaton identification in the class of Sprott's automata. Prikladnaâ diskretnaâ matematika, no. 1 (2008), pp. 131-135. http://geodesic.mathdoc.fr/item/PDM_2008_1_a21/