Abstract:
We establish estimates for the frequency of appearances of $r$-tuples in the complications of sequences generated by several filtering generators. These results are applied to the output sequences of combination generators. We also consider distribution properties of sequences, generated by encryption algorithm GEA-2.
Key words:finite fields, linear recurrent sequences, linear feedback shift registers, combination generators, filter generators.