Model of complication function for generator of pseudorandom sequences over the field GF(2)
A complication model for pseudorandom sequences (PRS) over 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.
Download file
Counter downloads: 406
Keywords
генератор, псевдослучайная последовательность, биективное преобразование, generator, pseudorandom sequence, the linear bijective transformationAuthors
| Name | Organization | |
| Zakharov V.M. | gilvv@mail.ru | |
| Zelinsky P. V. | ruslzel@mail.ru | |
| Shalagin S.V. | sshalagin@mail.ru |
References
Молдовян А. А., Молдовян Н. А., Гуц Н.Д., Изотов Б. В. Криптография: скоростные шифры. СПб.: БХВ-Петербург, 2002. 496с.
Колпаков А. В. Методы и алгоритмы линейных и аффинных преобразований для модели бинарных диаграмм решений: дис.. канд. техн. наук. Казань, 2004.
