Linear complexity of binary sequences derived from polynomial quotients

DOI10.1007/978-3-642-30615-0_17zbMATH Open1304.94024OpenAlexW85945872MaRDI QIDQ2907289FDOQ2907289

Authors: Zhixiong Chen, Domingo Gómez-Pérez 

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

Recommendations

• Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
• The linear complexity of binary sequences with period (2/sup n/-1)/sup k/
• On the linear complexity of binary threshold sequences derived from Fermat quotients
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
• An extension of binary threshold sequences from Fermat quotients

zbMATH Keywords

cryptographyfinite fieldslinear complexityFermat quotientspolynomial quotientspseudorandom binary sequences

Mathematics Subject Classification ID

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

Cited In (11)

• On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
• Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
• Polynomial quotients: Interpolation, value sets and Waring's problem
• Trace representation of pseudorandom binary sequences derived from Euler quotients
• On the k-error linear complexity of binary sequences derived from polynomial quotients
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
• Additive character sums of polynomial quotients
• Linear complexity of pseudorandom sequences based on summation of polynomial quotients
• Title not available (Why is that?)
• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• On the linear complexity of binary threshold sequences derived from Fermat quotients

This page was built for publication: Linear complexity of binary sequences derived from polynomial quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907289)