|
Cryptographically weak filter function for trinomial linear recurrent sequences
F. M. Malyshev Steklov Mathematical Institute of the Russian Academy of Sciences, Moscow
Abstract:
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.
Key words:
recurrent sequence, filter generator, pseudo-random sequence.
Received 30.IV.2014
Citation:
F. M. Malyshev, “Cryptographically weak filter function for trinomial linear recurrent sequences”, Mat. Vopr. Kriptogr., 8:1 (2017), 69–80
Linking options:
https://www.mathnet.ru/eng/mvk215https://doi.org/10.4213/mvk215 https://www.mathnet.ru/eng/mvk/v8/i1/p69
|
Statistics & downloads: |
Abstract page: | 398 | Full-text PDF : | 221 | References: | 42 | First page: | 1 |
|