Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2010, Volume 1, Issue 4, Pages 33–62
DOI: https://doi.org/10.4213/mvk20
(Mi mvk20)
 

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
Full-text PDF (241 kB) Citations (7)
References:
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
Document Type: Article
UDC: 511.336+519.113.6
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Kam10}
\by O.~V.~Kamlovskii
\paper Exponential sums method for frequencies of most significant bit $r$-patterns in linear recurrent sequences over $\mathbb{Z}_{2^n}$
\jour Mat. Vopr. Kriptogr.
\yr 2010
\vol 1
\issue 4
\pages 33--62
\mathnet{http://mi.mathnet.ru/mvk20}
\crossref{https://doi.org/10.4213/mvk20}
Linking options:
  • https://www.mathnet.ru/eng/mvk20
  • https://doi.org/10.4213/mvk20
  • https://www.mathnet.ru/eng/mvk/v1/i4/p33
  • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:588
    Full-text PDF :286
    References:91
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024