scientific article; zbMATH DE number 2051216
From MaRDI portal
Publication:4453508
zbMATH Open1043.65007MaRDI QIDQ4453508FDOQ4453508
Authors: Arne Winterhof, Gerhard Dorfer 
Publication date: 7 March 2004
Title of this publication is not available (Why is that?)
Recommendations
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators
- On the lattice structure of pseudorandom numbers generated over arbitrary finite fields
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- Remarks on nonlinear congruential pseudorandom numbers
Random number generation in numerical analysis (65C10) Complexity and performance of numerical algorithms (65Y20) Pseudo-random numbers; Monte Carlo methods (11K45)
Cited In (14)
- Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences
- Lattice structure and linear complexity of nonlinear pseudorandom numbers
- On the Structure of Inversive Pseudorandom Number Generators
- Title not available (Why is that?)
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Enumeration results on linear complexity profiles and lattice profiles
- On lattice profile of the elliptic curve linear congruential generators
- Hamming correlation of higher order
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- Pseudorandom sequences derived from automatic sequences
- On the structure of digital explicit nonlinear and inversive pseudorandom number generators
- On the \(N\)th linear complexity of automatic sequences
- On the counting function of the lattice profile of periodic sequences
- Counting functions and expected values for the lattice profile at \(n\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453508)
