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], 2014, Volume 5, Issue 3, Pages 17–34
DOI: https://doi.org/10.4213/mvk127
(Mi mvk127)
 

This article is cited in 1 scientific paper (total in 1 paper)

Nonabsolute bounds for incomplete exponential sums of elements of linear recurrent sequences and their applications

O. V. Kamlovsky

LLC "Certification Research Center", Moscow
Full-text PDF (757 kB) Citations (1)
References:
Abstract: We establish several upper bounds for some classes of incomplete exponential sums over Galois rings. We apply these results to cross-correlation coefficients and distribution properties of linear recurrent sequences.
Key words: linear recurrent sequences, incomplete exponential sums, Galois rings, cross-correlation coefficients.
Received 22.IV.2013
Document Type: Article
UDC: 511.216+519.113.6
Language: Russian
Citation: O. V. Kamlovsky, “Nonabsolute bounds for incomplete exponential sums of elements of linear recurrent sequences and their applications”, Mat. Vopr. Kriptogr., 5:3 (2014), 17–34
Citation in format AMSBIB
\Bibitem{Kam14}
\by O.~V.~Kamlovsky
\paper Nonabsolute bounds for incomplete exponential sums of elements of linear recurrent sequences and their applications
\jour Mat. Vopr. Kriptogr.
\yr 2014
\vol 5
\issue 3
\pages 17--34
\mathnet{http://mi.mathnet.ru/mvk127}
\crossref{https://doi.org/10.4213/mvk127}
Linking options:
  • https://www.mathnet.ru/eng/mvk127
  • https://doi.org/10.4213/mvk127
  • https://www.mathnet.ru/eng/mvk/v5/i3/p17
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:304
    Full-text PDF :182
    References:40
    First page:3
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024