On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators

DOI10.1109/TIT.2002.806144zbMath1063.65005MaRDI QIDQ4679880

Arne Winterhof, Jaime Gutierrez, Igor E. Shparlinski

Publication date: 31 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (16)

On the cycle structure of repeated exponentiation modulo a prime ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions ⋮ Multisequences with high joint nonlinear complexity ⋮ A new complexity metric for FH/SS sequences using fuzzy entropy ⋮ The Carlitz rank of permutations of finite fields: a survey ⋮ On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences ⋮ On the Structure of Inversive Pseudorandom Number Generators ⋮ Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials ⋮ Predicting nonlinear pseudorandom number generators ⋮ On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences ⋮ ON THE DISTRIBUTION OF COUNTER-DEPENDENT NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBER GENERATORS IN RESIDUE RINGS ⋮ On k-error linear complexity of some explicit nonlinear pseudorandom sequences ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders ⋮ On the linear complexity profile of explicit nonlinear pseudorandom numbers.

This page was built for publication: On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators