On k-error linear complexity of some explicit nonlinear pseudorandom sequences

DOI10.1007/S11859-008-0513-6MaRDI QIDQ3403211zbMATH OpenOpenAlexFDO

Authors

Publication date 12 February 2010

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11859-008-0513-6

zbMATH Keywords

\(k\)-error linear complexityexplicit inversive generatorsstream ciphers

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• On the k-error linear complexity of -sequences
• A relationship between linear complexity and k-error linear complexity
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• On the \(k\)-error linear complexity of sequences from function fields

Cites work

• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• Finite binary sequences constructed by explicit inversive methods
• scientific article; zbMATH DE number 3910296 (Why is no real title available?)
• scientific article; zbMATH DE number 1196713 (Why is no real title available?)
• Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
• Lattice structure and linear complexity of nonlinear pseudorandom numbers
• On the correlation of pseudorandom numbers generated by inversive methods
• On the distribution of compound inversive congruential pseudorandom numbers
• On the distribution of inversive congruential pseudorandom numbers in parts of the period
• On the distribution of pseudorandom numbers and vectors generated by inversive methods
• On the distribution of some new explicit inverse pseudorandom numbers and vectors
• On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• On the linear complexity profile of some new explicit inversive pseudorandom numbers

Cited in

(2)

• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations

This page was built for publication: On \(k\)-error linear complexity of some explicit nonlinear pseudorandom sequences

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