Linear Complexity of Binary Sequences Derived from Polynomial Quotients

DOI10.1007/978-3-642-30615-0_17zbMath1304.94024OpenAlexW85945872MaRDI QIDQ2907289

No author found.

Publication date: 7 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30615-0_17

zbMATH Keywords

finite fieldscryptographylinear complexityFermat quotientspseudorandom binary sequencespolynomial quotients

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (7)

Trace representation and linear complexity of binary sequences derived from Fermat quotients ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ Polynomial quotients: Interpolation, value sets and Waring's problem ⋮ Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus ⋮ Additive character sums of polynomial quotients

This page was built for publication: Linear Complexity of Binary Sequences Derived from Polynomial Quotients