An approach to the transformation of periodic sequences
-
Vladimir G. Chirskii
and
Aleksey Yu. Nesterenko
Abstract
We consider a periodic sequence
Originally published in Diskretnaya Matematika (2015) 27, №4, 150-157 (in Russian).
Acknowledgment
The authors are indebted to Professor V.Kh.Salikhov for useful discussions.
References
[1] Alferov A. P., Zubov A. Yu., Kuz’min A. S., Cheremushkin A. V., Basics of Cryptography, Textbook, Gelios, Moscow, 2001 (In Russian), 480 pp.Search in Google Scholar
[2] Nesterenko Yu. V., Number Theory, Textbook, Izd. Centre ACADEMIA, Moscow, 2008 (In Russian), 272 pp.Search in Google Scholar
[3] Fomichev B. M., Methods of Discrete Mathematics in Cryptology, Dialog-MIFI, Moscow, 2010 (In Russian), 424 pp.Search in Google Scholar
[4] Shidlovskii A. B., Transcendental numbers, W. de Gruyter GmbH, Berlin, 1989,466 pp.10.1515/9783110889055Search in Google Scholar
[5] Bertrand D., Chirskii V., Yebbou Y, “Efective estimates for global relations on Euler-type series”, Ann.Fac.Sci.Toulouse, XIII:2 (2004), 241-26010.5802/afst.1069Search in Google Scholar
© 2017 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- An approach to the transformation of periodic sequences
- On the number of functions of k-valued logic which are polynomials modulo composite k
- Upper bounds for the size and the depth of formulae for MOD-functions
- Mean and variance of the number of subfunctions of random Boolean function which are close to the affine functions set
- The second coordinate sequence of the MP-LRS over nontrivial Galois ring of an odd characteristic
- On the asymptotics of the number of repetition-free Boolean functions in the basis {&, ∨, ⊕, ¬}
- On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
Articles in the same Issue
- Frontmatter
- An approach to the transformation of periodic sequences
- On the number of functions of k-valued logic which are polynomials modulo composite k
- Upper bounds for the size and the depth of formulae for MOD-functions
- Mean and variance of the number of subfunctions of random Boolean function which are close to the affine functions set
- The second coordinate sequence of the MP-LRS over nontrivial Galois ring of an odd characteristic
- On the asymptotics of the number of repetition-free Boolean functions in the basis {&, ∨, ⊕, ¬}
- On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
