On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes

DOI10.1515/DMA.2010.004zbMath1241.11140MaRDI QIDQ3586260

Vladimir Edemskiy

Publication date: 6 September 2010

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Unnamed Item ⋮ Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) ⋮ Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\) ⋮ On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\) ⋮ The linear complexity of balanced quaternary sequences with optimal autocorrelation value ⋮ The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation ⋮ Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\) ⋮ An extension of binary cyclotomic sequences having order 2lt ⋮ About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\) ⋮ Linear complexity of cyclotomic sequences of order six and BCH codes over \(\mathrm{GF}(3)\) ⋮ Some new balanced and almost balanced quaternary sequences with low autocorrelation ⋮ The linear complexity of generalized cyclotomic sequences with period \(2p^n\) ⋮ Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight ⋮ Unnamed Item

Cites Work

• Public-key cryptosystems based on cubic finite field extensions
• New self-dual codes over GF(4) with the highest known minimum weights

This page was built for publication: On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes