|
Prikladnaya Diskretnaya Matematika. Supplement, 2014, Issue 7, Pages 67–68
(Mi pdma191)
|
|
|
|
Pseudorandom Generators
Model of complication function for generator of pseudorandom sequences over the field $\mathrm{GF}(2)$
V. M. Zakharova, R. V. Zelinskyb, S. V. Shalagina a Kazan State Technical University, Kazan
b Vostok Branch, Kazan' State Technical University, Chistopol'
Abstract:
A complication model for pseudorandom sequences (PRS) over $\mathrm{GF}(2)$ is proposed. The complication function in the model is represented by the system of linear bijective transformations of bit pairs being next in turn in the sequence. Transformations in the system can vary from time to time making possible to generate a great ensemble of complicated PRS.
Keywords:
generator, pseudorandom sequence, the linear bijective transformation.
Citation:
V. M. Zakharov, R. V. Zelinsky, S. V. Shalagin, “Model of complication function for generator of pseudorandom sequences over the field $\mathrm{GF}(2)$”, Prikl. Diskr. Mat. Suppl., 2014, no. 7, 67–68
Linking options:
https://www.mathnet.ru/eng/pdma191 https://www.mathnet.ru/eng/pdma/y2014/i7/p67
|
Statistics & downloads: |
Abstract page: | 197 | Full-text PDF : | 79 | References: | 39 |
|