Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://dspace.opu.ua/jspui/handle/123456789/7839
Название: Construction Method for Infinite Families of Bent Sequences
Авторы: Sokolov, A. V.
Tsevukh, I. V.
Соколов, Артем Викторович
Цевух, Игорь Васильевич
Ключевые слова: bent-sequence
Maiorana-McFarland construction
recursive method
Дата публикации: 2018
Библиографическое описание: Sokolov, A. V. Construction Method for Infinite Families of Bent Sequences / A. V. Sokolov, I. V. Tsevukh // Journal of Telecommunication, Electronic and Computer Engineering. - 2018. - Vol. 10, N 2. - P. 51-54.
Sokolov, A. V., Tsevukh, I. V. (2018). Construction Method for Infinite Families of Bent Sequences. Journal of Telecommunication, Electronic and Computer Engineering, Vol. 10, N 2, 51-54.
Краткий осмотр (реферат): Bent-sequences is one of the most important classes of Boolean functions, which are widely used in modern cryptographic algorithms, and telecommunication systems that are based on CDMA and OFDM standards. The problem of synthesis of bent-sequences of large lengths is actual and widely discussed. However, in view of the high complexity and unpredictability of the class of bent-sequences, the creation of methods for their synthesis faces significant difficulties. In this paper, a recursive method for constructing infinite families of bent-sequences, based on easily synthesized bent-sequences of small length, has been developed. As the basis of this method, the operations of interleaving of elements and strings, which are widely used in the theory of synthesis of perfect binary arrays, are applied. Effective reproduction rules for bent-sequences in the time domain based on the operation of rearrangement of segments, a rotor, and dimensional changes are proposed. The method developed allows rapid acquisition of a lot of bentsequences of any predefined length. Moreover, the obtained bent-sequences belong to different classes according to Agievich classification, which is important from the cryptographic point of view.
URI (Унифицированный идентификатор ресурса): http://dspace.opu.ua/jspui/handle/123456789/7839
Располагается в коллекциях:Статті каф. РТС

Файлы этого ресурса:
Файл Описание РазмерФормат 
3274-10497-1-PB (1).pdf416.01 kBAdobe PDFПросмотреть/Открыть


Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.