Pseudorandom vector generation by the inversive method
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the linear complexity profile of explicit nonlinear pseudorandom numbers
Information Processing Letters
On the linear complexity profile of some new explicit inversive pseudorandom numbers
Journal of Complexity - Special issue on coding and cryptography
On the counting function of the lattice profile of periodic sequences
Journal of Complexity
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
IEEE Transactions on Information Theory
Finite binary sequences constructed by explicit inversive methods
Finite Fields and Their Applications
Counting functions and expected values for the lattice profile at n
Finite Fields and Their Applications
The Period Lengths of Inversive Pseudorandom Vector Generations
Finite Fields and Their Applications
Recent results on recursive nonlinear pseudorandom number generators
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Structure of pseudorandom numbers derived from fermat quotients
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
| Hi-index | 0.00 |
We analyze the lattice structure and linear complexity of a new inversive pseudorandom number generator recently introduced by Niederreiter and Rivat. In particular, we introduce a new lattice test which is much stronger than its predecessors and prove that this new generator passes it up to very high dimensions. Such a result cannot be obtained for the conventional inversive generator with currently known methods. We also analyze the behavior of two explicit inversive generators under this new test and present lower bounds on the linear complexity profile of binary sequences derived from these three inversive generators.