Geodesic
Probabilistic linear relations in binary recurring sequences
Matematičeskie voprosy kriptografii, Tome 8 (2017) no. 3, pp. 57-84 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We consider algebraic methods of searching for probabilistic linear relations on the segment of a binary linear recurring sequence. The complexity of suggested algorithms is estimated. 
@article{MVK_2017_8_3_a2,
     author = {O. A. Kozlitin},
     title = {Probabilistic linear relations in binary recurring sequences},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {57--84},
     year = {2017},
     volume = {8},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2017_8_3_a2/}
}
TY  - JOUR
AU  - O. A. Kozlitin
TI  - Probabilistic linear relations in binary recurring sequences
JO  - Matematičeskie voprosy kriptografii
PY  - 2017
SP  - 57
EP  - 84
VL  - 8
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MVK_2017_8_3_a2/
LA  - ru
ID  - MVK_2017_8_3_a2
ER  - 
%0 Journal Article
%A O. A. Kozlitin
%T Probabilistic linear relations in binary recurring sequences
%J Matematičeskie voprosy kriptografii
%D 2017
%P 57-84
%V 8
%N 3
%U http://geodesic.mathdoc.fr/item/MVK_2017_8_3_a2/
%G ru
%F MVK_2017_8_3_a2
O. A. Kozlitin. Probabilistic linear relations in binary recurring sequences. Matematičeskie voprosy kriptografii, Tome 8 (2017) no. 3, pp. 57-84. http://geodesic.mathdoc.fr/item/MVK_2017_8_3_a2/

[1] Babash A. V., Shankin G. P., Kriptografiya, Solon-R, M., 2002, 512 pp.

[2] Glukhov M. M., Elizarov V. P., Nechaev A. A., Algebra, V 2 t., Gelios-ARV, M., 2003, 336+415 pp.

[3] Glukhov M. M., Kozlitin O. A., Shaposhnikov V. A., Shishkov A. B., Zadachi i uprazhneniya po matematicheskoi logike, diskretnym funktsiyam i teorii algoritmov, Lan, SPb., 2008, 112 pp.

[4] Glukhov M. M., Shishkov A. B., Matematicheskaya logika. Diskretnye funktsii. Teoriya algoritmov, Lan, SPb., 2012, 416 pp.

[5] Gonsales S., Kouselo E., Markov V., Nechaev A., “Parametry rekursivnykh MDR-kodov”, Diskretnaya matematika, 12:4 (2000), 3–24 | DOI

[6] Lidl R., Niderraiter G., Konechnye polya, V 2 t., Mir, M., 1988, 808 pp.

[7] Logachev O. A., Salnikov A. A., Smyshlyaev S. V., Yaschenko V. V., Bulevy funktsii v teorii kodirovaniya i kriptologii, MTsNMO, M., 2012, 584 pp.

[8] Mak-Vilyams F. D., Sloen N. D. A., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979, 744 pp.

[9] McEliece R. J., “Irreducible cyclic codes and Gauss sums”, Combinatorics, Reidel, Dordrecht–Boston, 1975, 185–202 | DOI