On the linear complexity profile of explicit nonlinear pseudorandom numbers

Authors:
Wilfried Meidl;Arne Winterhof
Affiliations:
Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, 1010 Vienna, Austria;Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, 1010 Vienna, Austria
Venue:
Information Processing Letters
Year:
2003

Citing 8
Cited 8

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
A generalization of a congruential property of Lucas

American Mathematical Monthly
On generalized inversive congruential pseudorandom numbers

Mathematics of Computation
Permutation polynomials, de Bruijn sequences, and linear complexity

Journal of Combinatorial Theory Series A
Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing: Proceedings of a Conference at the University of Nevada, Las Vegas, Nevada, USA, June 23-25, 1994

Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing: Proceedings of a Conference at the University of Nevada, Las Vegas, Nevada, USA, June 23-25, 1994
Handbook of Applied Cryptography

Handbook of Applied Cryptography
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators

IEEE Transactions on Information Theory

On the linear complexity profile of some new explicit inversive pseudorandom numbers

Journal of Complexity - Special issue on coding and cryptography
On the joint linear complexity profile of explicit inversive multisequences

Journal of Complexity
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem

Discrete Applied Mathematics - Special issue: Coding and cryptography
On the structure of digital explicit nonlinear and inversive pseudorandom number generators

Journal of Complexity
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem

Discrete Applied Mathematics - Special issue: Coding and cryptography
On the joint linear complexity profile of explicit inversive multisequences

Journal of Complexity
On the structure of inversive pseudorandom number generators

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Finite binary sequences constructed by explicit inversive methods

Finite Fields and Their Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

Bounds on the linear complexity profile of a general explicit nonlinear pseudorandom number generator are obtained. For some special explicit nonlinear generators including the explicit inversive generator these results are improved.