Frequency characteristics of cycles in output sequences generated by combining generators over the field of two elements
Prikladnaâ diskretnaâ matematika, no. 3 (2015), pp. 17-31.

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

Some formulas are given for counting the number of elements in the cycles of output sequences generated by combining generators over the field of two elements. From these formulas, some estimates of the considered frequencies appear. Also, formulas for calculation of the autocorrelation functions and Hamming distances between the line segments of these sequences are obtained.
Keywords: combining generator, linear recurrent sequences, distribution properties of recurrent, a pseudo-random sequence.
@article{PDM_2015_3_a1,
     author = {I. B. Bilyak and O. V. Kamlovskii},
     title = {Frequency characteristics of cycles in output sequences generated by combining generators over the field of two elements},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {17--31},
     publisher = {mathdoc},
     number = {3},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2015_3_a1/}
}
TY  - JOUR
AU  - I. B. Bilyak
AU  - O. V. Kamlovskii
TI  - Frequency characteristics of cycles in output sequences generated by combining generators over the field of two elements
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2015
SP  - 17
EP  - 31
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2015_3_a1/
LA  - ru
ID  - PDM_2015_3_a1
ER  - 
%0 Journal Article
%A I. B. Bilyak
%A O. V. Kamlovskii
%T Frequency characteristics of cycles in output sequences generated by combining generators over the field of two elements
%J Prikladnaâ diskretnaâ matematika
%D 2015
%P 17-31
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2015_3_a1/
%G ru
%F PDM_2015_3_a1
I. B. Bilyak; O. V. Kamlovskii. Frequency characteristics of cycles in output sequences generated by combining generators over the field of two elements. Prikladnaâ diskretnaâ matematika, no. 3 (2015), pp. 17-31. http://geodesic.mathdoc.fr/item/PDM_2015_3_a1/

[1] Alferov A. P., Zubov A. Yu., Kuz'min A. S., Cheremushkin A. V., Basics of Cryptography, Gelios ARV Publ., Moscow, 2001, 480 pp. (in Russian)

[2] Fomichev V. M., Metody diskretnoy matematiki v kriptologii, Dialog-MIFI Publ., Moscow, 2010, 424 pp. (in Russian)

[3] Rueppel R. A., Analysis and Design of Stream Ciphers, Springer Verlag, 1986, 244 pp. | MR | Zbl

[4] Glukhov M. M., Elizarov V. P., Nechaev A. A., Algebra, v. 2, Gelios ARV Publ., Moscow, 2003, 416 pp. (in Russian)

[5] Lidl R., Niderrayter G., Finite Fields, v. 1, 2, Mir Publ., Moscow, 1988, 822 pp. (in Russian)

[6] Fomichev V. M., “On periods of complicated sequences”, Matematicheskie Voprosy Kibernetiki, 13, Fizmatlit Publ., Moscow, 2004, 37–40 (in Russian) | MR

[7] Logachev O. A., Sal'nikov A. A., Smyshlyaev S. V., Yashchenko V. V., Boolean Functions in Coding Theory and Cryptology, MCCME Publ., Moscow, 2012, 584 pp. (in Russian)

[8] Niederreiter H., “Weights of cyclic codes”, Information and Control, 34 (1977), 130–140 | DOI | MR | Zbl

[9] Golomb S. W., Gong G., Signal Design for Good Correlation, Cambridge, 2005, 438 pp. | MR