RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2017 Volume 8, Issue 1, Pages 69–80 (Mi mvk215)

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.

UDC: 519.719.2

Received 30.IV.2014

DOI: 10.4213/mvk215



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024