|
This article is cited in 7 scientific papers (total in 7 papers)
Exponential sums method for frequencies of most significant bit $r$-patterns in linear recurrent sequences over $\mathbb{Z}_{2^n}$
O. V. Kamlovskii LLC "Certification Research Center", Moscow
Abstract:
By means of exponential sums method we investigate distributions of $r$-patterns in the most significant bit of linear recurrent sequences over $\mathbb{Z}_{2^n}$ such that their characteristic polynomials reduced to mod $2$ are irreducible over $GF(2)$.
Key words:
exponential sums, character sums estimates, linear recurrent sequences, most significant bit sequences, $r$-patterns distributions.
Received 22.IV.2010
Citation:
O. V. Kamlovskii, “Exponential sums method for frequencies of most significant bit $r$-patterns in linear recurrent sequences over $\mathbb{Z}_{2^n}$”, Mat. Vopr. Kriptogr., 1:4 (2010), 33–62
Linking options:
https://www.mathnet.ru/eng/mvk20https://doi.org/10.4213/mvk20 https://www.mathnet.ru/eng/mvk/v1/i4/p33
|
Statistics & downloads: |
Abstract page: | 588 | Full-text PDF : | 286 | References: | 91 | First page: | 2 |
|