Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://dspace.opu.ua/jspui/handle/123456789/7839
Полная запись метаданных
Поле DCЗначениеЯзык
dc.contributor.authorSokolov, A. V.-
dc.contributor.authorTsevukh, I. V.-
dc.contributor.authorСоколов, Артем Викторович-
dc.contributor.authorЦевух, Игорь Васильевич-
dc.date.accessioned2018-07-11T06:56:22Z-
dc.date.available2018-07-11T06:56:22Z-
dc.date.issued2018-
dc.identifier.citationSokolov, 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.en
dc.identifier.citationSokolov, 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.en
dc.identifier.urihttp://dspace.opu.ua/jspui/handle/123456789/7839-
dc.description.abstractBent-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.en
dc.language.isoenen
dc.subjectbent-sequenceen
dc.subjectMaiorana-McFarland constructionen
dc.subjectrecursive methoden
dc.titleConstruction Method for Infinite Families of Bent Sequencesen
dc.typeArticleen
opu.kafedraКафедра радіотехнічних системUK
opu.citation.journalJournal of Telecommunication, Electronic and Computer Engineeringen
opu.citation.volume10en
opu.citation.firstpage51en
opu.citation.lastpage54en
opu.citation.issue2en
opu.staff.idsokolov.a.v@opu.uaen
Располагается в коллекциях:Статті каф. РТС

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


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