|
This article is cited in 2 scientific papers (total in 2 papers)
Cyclic types of families of polylinear recurrent sequences and generators of pseudorandom numbers
A. V. Mikhaleva, A. A. Nechaevb a Lomonosov Moscow State University, Moscow
b Academy of Cryptography of the Russian Federation, Moscow
Abstract:
We investigate the approach to the construction of the generator of pseudorandom sequences by means of an automaton realizing the family of polylinear recurrent sequences. As characteristics describing potentially possible periods of output sequences of such generator we consider the cyclic type and the function of periods. Descriptions of these characteristics for families of geometric, arithmetic and congruent polylinear sequences over finite field are provided.
Key words:
polylinear recurrent sequences, finite fields, pseudorandom sequences, cycle type.
Received 20.IV.2012
Citation:
A. V. Mikhalev, A. A. Nechaev, “Cyclic types of families of polylinear recurrent sequences and generators of pseudorandom numbers”, Mat. Vopr. Kriptogr., 5:1 (2014), 95–125
Linking options:
https://www.mathnet.ru/eng/mvk109https://doi.org/10.4213/mvk109 https://www.mathnet.ru/eng/mvk/v5/i1/p95
|
Statistics & downloads: |
Abstract page: | 525 | Full-text PDF : | 295 | References: | 79 | First page: | 5 |
|