The linear complexity of generalized cyclotomic binary sequences of period

V Edemskiy, C Li, X Zeng, T Helleseth - Designs, Codes and Cryptography, 2019 - Springer
This paper examines the linear complexity of a family of generalized cyclotomic binary
sequences of period p^ n pn recently proposed by Xiao et al.(Des Codes Cryptogr, 2017 …

Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period

V Edemskiy, N Sokolovskii - International Conference on Information …, 2019 - Springer
In this paper, we construct new q-ary generalized cyclotomic sequences of length 2 p^ n. We
study the linear complexity of these sequences over the finite field of order q and show that …

The linear complexity of new binary cyclotomic sequences of period

V Edemskiy - arXiv preprint arXiv:1712.03947, 2017 - arxiv.org
In this paper, we determine the linear complexity of a class of new binary cyclotomic
sequences of period pn constructed by Z. Xiao et al.(Des. Codes Cryptogr. DOI …

Trace representation of balanced quaternary generalized cyclotomic sequences of period pn

F YAN, P KE, Z CHANG - IEICE Transactions on Fundamentals of …, 2024 - jstage.jst.go.jp
Recently, trace representation of a class of balanced quaternary sequences of period 𝑝 from
the classical cyclotomic classes was given by Yang et al.(Cryptogr. Commun., 15 (2023) …

Linear Complexity of New r-Ary Sequences of Length pnqm

VA Edemskiy, SV Garbar - Computer Science On-line Conference, 2023 - Springer
In this paper, we construct the family of non-binary sequences and show that these
sequences have high linear complexity over the finite field of odd order. These sequences …

The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods pn and 2pn

V Edemskiy, N Sokolovskiy - Cryptography and Communications, 2022 - Springer
In this paper, first we consider the linear complexity of quaternary sequences over the finite
ring of order four and the finite field of order four. These sequences are constructed from …

[HTML][HTML] АНАЛИЗ ЛИНЕЙНОЙ СЛОЖНОСТИ Q-ИЧНЫХ ОБОБЩЕННЫХ ЦИКЛОТОМИЧЕСКИХ ПОСЛЕДОВАТЕЛЬНОСТЕЙ ПЕРИОДА PN

ВА Едемский - Вестник Астраханского государственного …, 2021 - cyberleninka.ru
К рассмотрению предложен анализ линейной сложности периодических-ичных
последовательностей при изменении k их членов на периоде. Последовательности …

Design sequences with high linear complexity over finite fields using generalized cyclotomy

V Edemskiy, X Du - Cryptography and Communications, 2017 - Springer
Based on the generalized cyclotomy theory, we design some classes of sequences with
high linear complexity over the finite fields. First, we construct a new class of sequence from …

Линейная сложность обобщенных циклотомических последовательностей периода qpn

ВА Едемский, АВ Иванов - … государственного университета им …, 2019 - cyberleninka.ru
Линейная сложность последовательности над конечным полем является ее важной
характеристикой, значимой при применении в потоковых шифрах в системах передачи …