On the linear complexity profile of explicit nonlinear pseudorandom numbers.

DOI10.1016/S0020-0190(02)00335-6zbMath1042.68053OpenAlexW2060383189MaRDI QIDQ1853169

Wilfried Meidl, Arne Winterhof

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00335-6

zbMATH Keywords

CryptographyComputational complexityLinear complexity profileExplicit inversive generatorExplicit nonlinear pseudorandom number generator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (10)

Multisequences with high joint nonlinear complexity ⋮ Normality of the Thue-Morse function for finite fields along polynomial values ⋮ On the structure of digital explicit nonlinear and inversive pseudorandom number generators ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ Expansion complexity and linear complexity of sequences over finite fields ⋮ Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ On k-error linear complexity of some explicit nonlinear pseudorandom sequences ⋮ On the linear complexity profile of some new explicit inversive pseudorandom numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation polynomials, de Bruijn sequences, and linear complexity
• Linear Complexity and Random Sequences
• A Generalization of a Congruential Property of Lucas
• Statistical Independence of a New Class of Inversive Congruential Pseudorandom Numbers
• 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
• Shift-register synthesis and BCH decoding
• On the lattice structure of pseudorandom numbers generated over arbitrary finite fields

This page was built for publication: On the linear complexity profile of explicit nonlinear pseudorandom numbers.