Geodesic
Cryptographically weak filter function for trinomial linear recurrent sequences
Matematičeskie voprosy kriptografii, Tome 8 (2017) no. 1, pp. 69-80 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We consider filter generators of pseudorandom sequences with binary input linear recurrent sequence having trinomial connection polynomial. Several classes of Boolean filter functions are described alowing to construct linear relations between the elements of input recurrent sequence by special subsets of output sequence. The admissibility of using such functions in the filter generators requires special justification. 
@article{MVK_2017_8_1_a5,
     author = {F. M. Malyshev},
     title = {Cryptographically weak filter function for trinomial linear recurrent sequences},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {69--80},
     year = {2017},
     volume = {8},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2017_8_1_a5/}
}
TY  - JOUR
AU  - F. M. Malyshev
TI  - Cryptographically weak filter function for trinomial linear recurrent sequences
JO  - Matematičeskie voprosy kriptografii
PY  - 2017
SP  - 69
EP  - 80
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MVK_2017_8_1_a5/
LA  - ru
ID  - MVK_2017_8_1_a5
ER  - 
%0 Journal Article
%A F. M. Malyshev
%T Cryptographically weak filter function for trinomial linear recurrent sequences
%J Matematičeskie voprosy kriptografii
%D 2017
%P 69-80
%V 8
%N 1
%U http://geodesic.mathdoc.fr/item/MVK_2017_8_1_a5/
%G ru
%F MVK_2017_8_1_a5
F. M. Malyshev. Cryptographically weak filter function for trinomial linear recurrent sequences. Matematičeskie voprosy kriptografii, Tome 8 (2017) no. 1, pp. 69-80. http://geodesic.mathdoc.fr/item/MVK_2017_8_1_a5/

[1] Shnaier B., Prikladnaya kriptografiya. Protokoly, algoritmy, iskhodnye teksty na yazyke Si, TRIUMF, M., 2003, 816 pp.

[2] Malyshev F. M., “Slozhnost vosstanovleniya nachalnykh znakov filtruyuschikh generatorov odnogo klassa”, Matematicheskie voprosy kriptografii, 6:1 (2015), 109–116

[3] Malyshev F. M., “Porozhdayuschie nabory elementov rekurrentnykh posledovatelnostei”, Trudy po diskretnoi matematike, 11:2 (2008), 86–111

[4] Balakin G. V., “O vozmozhnosti chastichnogo vosstanovleniya nekotorykh posledovatelnostei po nablyudeniyam”, Matematicheskie voprosy kriptografii, 4:4 (2013), 7–25