Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

AAECC
2002
Springer

favoriteEmaildiscussreport

132views Algorithms» more AAECC 2002»

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers

13 years 10 months ago

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers

Download www.ricam.oeaw.ac.at

It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity is large. The consequences of this result for nonlinear and inversive pseudorandom number generators are worked out.

Harald Niederreiter, Arne Winterhof

Real-time Traffic

AAECC 2002 | Algorithms | Finite Field Fq | Inversive Pseudorandom Number | Lattice Test |

claim paper

Related Content

» Continued fraction for formal laurent series and the lattice structure of sequences

» Gradual Sublattice Reduction and a New Complexity for Factoring Polynomials

» Breathers in a Pinned Mechanical Lattice

» Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation

» The Structure of Sparse Resultant Matrices

» Efficient Enumeration of Frequent Sequences

» Avoiding Divergence in the ShalviWeinstein Algorithm

» On the differential and linear efficiency of balanced Feistel networks

» Polynomial Linear Programming with Gaussian Belief Propagation

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2002
Where	AAECC
Authors	Harald Niederreiter, Arne Winterhof

Comments (0)