On cyclotomic generator of order \(r\).

DOI10.1016/S0020-0190(98)00025-8zbMath1078.94511OpenAlexW2003125393MaRDI QIDQ2583534

Cunsheng Ding, Tor Helleseth

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00025-8

zbMATH Keywords

CryptographyCodesSequences

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (9)

Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\) ⋮ Sequences related to Legendre/Jacobi sequences ⋮ A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity ⋮ Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\) ⋮ Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\) ⋮ Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences ⋮ Polynomial representations of the Lucas logarithm ⋮ On the k-error linear complexity of cyclotomic sequences ⋮ Remarks on a cyclotomic sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• De Bruijn sequences, irreducible codes and cyclotomy
• The stability theory of stream ciphers
• Design of Sequences with Specified Autocorrelation and Cross Correlation
• Binary pulse compression codes
• Cyclotomy, Higher Congruences, and Waring's Problem II

This page was built for publication: On cyclotomic generator of order \(r\).