scientific article; zbMATH DE number 2110656

zbMath1069.11053MaRDI QIDQ4823178

Cunsheng Ding, Thomas W. Cusick, Ari Renvall

Publication date: 26 October 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

correlationpermutationskeystream generatorslinear complexitycyclotomypattern distributionopen research problems2-adic approachcryptographic function with good security parametersdesign of cryptographic functionsfast stream cipher algorithmsquadratic partitionsstream ciphers and number theory

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Cyclotomy (11T22) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

Related Items (28)

Spectra of a class of quadratic functions: average behaviour and counting functions ⋮ Nonexistence of twenty-fourth power residue addition sets ⋮ The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) ⋮ On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences ⋮ Constructing commutative semifields of square order ⋮ Cyclic codes from two-prime generalized cyclotomic sequences of order 6 ⋮ A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity ⋮ The linear complexity of generalized cyclotomic binary sequences of period \(p^n\) ⋮ Toward the classification of biangular harmonic frames ⋮ Quadratic functions with prescribed spectra ⋮ Introduction to the special issue dedicated to Cunsheng Ding on the occasion of his 60th birthday ⋮ Estimate of 4-adic complexity of unified quaternary sequences of length \(2p \) ⋮ On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period \(4p^n \) ⋮ Autocorrelation of the Modified Binary Two-Prime Sidelnikov Sequence ⋮ Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\) ⋮ Correlation of the two-prime Sidel'nikov sequence ⋮ Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ A lower bound on the 2-adic complexity of the modified Jacobi sequence ⋮ The linear complexity of a class of binary sequences with period \(2p\) ⋮ On the arithmetic autocorrelation of the Legendre sequence ⋮ Constructions of almost difference sets from finite fields ⋮ Efficient prime counting and the Chebyshev primes ⋮ Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients ⋮ Multidimensional linear complexity analysis of periodic arrays ⋮ Binary sequences derived from differences of consecutive quadratic residues ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields ⋮ Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight

This page was built for publication: