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

DOI10.1007/s11859-008-0513-6zbMath1199.68127OpenAlexW1988687835MaRDI QIDQ3403211

No author found.

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

stream ciphers\(k\)-error linear complexityexplicit inversive generators

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite binary sequences constructed by explicit inversive methods
• On the linear complexity profile of some new explicit inversive pseudorandom numbers
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• Lattice structure and linear complexity of nonlinear pseudorandom numbers
• On the distribution of pseudorandom numbers and vectors generated by inversive methods
• On the correlation of pseudorandom numbers generated by inversive methods
• On the distribution of inversive congruential pseudorandom numbers in parts of the period
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
• On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
• On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers
• On the distribution of compound inversive congruential pseudorandom numbers

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