Efficient HEVC steganography approach based on audio compression and encryption in QFFT domain for secure multimedia communication
Abstract High-Efficiency Video Coding (HEVC) is the most recent video codec standard. It is
substantial to analyze the HEVC steganography process due to its practical and academic …
substantial to analyze the HEVC steganography process due to its practical and academic …
Linear complexity over and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
Y Wang, X Han, W Wang, Z Heng - Designs, Codes and Cryptography, 2022 - Springer
A class of binary sequences with period 2 p is constructed using generalized cyclotomic
classes, and their linear complexity, minimal polynomial over F q as well as 2-adic …
classes, and their linear complexity, minimal polynomial over F q as well as 2-adic …
The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation
V Edemskiy, A Palvinskiy - Information Processing Letters, 2016 - Elsevier
In this paper we derive the linear complexity of binary sequences of length 2 p with optimal
three-level autocorrelation. These almost balanced and balanced sequences are …
three-level autocorrelation. These almost balanced and balanced sequences are …
On the linear complexity of Hall's sextic residue sequences over
V Edemskiy, N Sokolovskiy - Journal of Applied Mathematics and …, 2017 - Springer
In this paper, we derive the linear complexity of Hall's sextic residue sequences over the
finite field of odd prime order. The order of the field is not equal to a period of the sequence …
finite field of odd prime order. The order of the field is not equal to a period of the sequence …
Notes about the linear complexity of Ding-Helleseth generalized cyclotomic sequences of length pq over the finite field of order p or q
V Edemskiy, N Sokolovskiy - ITM web of conferences, 2017 - itm-conferences.org
We investigate three classes of Ding-Helleseth-generalized cyclotomic sequences of length
pq. We derive the linear complexity and the minimal polynomial of above-mentioned …
pq. We derive the linear complexity and the minimal polynomial of above-mentioned …
Linear complexity of a class of pseudorandom sequences over a general finite field
Due to their nice algebraic structures and pseudorandom features, generalized cyclotomic
sequences have wide applications in simulation, coding and cryptography. Based on the …
sequences have wide applications in simulation, coding and cryptography. Based on the …
Linear Complexity and Trace Representation of New Ding Generalized Cyclotomic Sequences with Period pq and Order Two
J Ma, W Zhao, Y Jia, X Shen, H Jiang - Mathematics, 2021 - mdpi.com
Linear complexity is an important property to measure the unpredictability of pseudo-random
sequences. Trace representation is helpful for analyzing cryptography properties of pseudo …
sequences. Trace representation is helpful for analyzing cryptography properties of pseudo …
[PDF][PDF] Notes about the linear complexity of cyclotomic sequences of order six and corresponding cyclic codes
V Edemskiy, N Sokolovskiy, A Tsurina - Russian Finnish Symposium …, 2017 - research.utu.fi
Using of cyclotomic classes to construct sequences, which are called cyclotomic sequences,
is an important method for sequence design. The linear complexity LC of a sequence is an …
is an important method for sequence design. The linear complexity LC of a sequence is an …
Linear complexity over and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation
Y Wang, X Han, W Wang, Z Heng - arxiv preprint arxiv:2109.02095, 2021 - arxiv.org
A class of binary sequences with period $2 p $ is constructed using generalized cyclotomic
classes, and their linear complexity, minimal polynomial over ${\mathbb {F} _ {{q}}} $ as well …
classes, and their linear complexity, minimal polynomial over ${\mathbb {F} _ {{q}}} $ as well …
Linear Complexity over Fq of Generalized Cyclotomic Quaternary Sequences with Period 2p
Let r be an odd prime, such that r≥ 5 and r≠ p, m be the order of r modulo p. Then, there
exists a 2p th root of unity in the extension field F r m. Let G (x) be the generating polynomial …
exists a 2p th root of unity in the extension field F r m. Let G (x) be the generating polynomial …