Lattice structure and linear complexity of nonlinear pseudorandom numbers (Q1861173): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Harald Niederreiter / rank | |||
Property / reviewed by | |||
Property / reviewed by: Yaochen Zhu / rank | |||
Property / author | |||
Property / author: Harald Niederreiter / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Yaochen Zhu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s002000200105 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2055360862 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:53, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lattice structure and linear complexity of nonlinear pseudorandom numbers |
scientific article |
Statements
Lattice structure and linear complexity of nonlinear pseudorandom numbers (English)
0 references
13 March 2003
0 references
Let \(q\) be a prime power and \(\mathbb F_q\) be the finite field of order \(q\). Let \(s\geq 1\). the authors first give an extended version of Marsaglia's lattice test as follows: A sequence \(\eta_0, \eta_1,\dots\) over \(\mathbb F_q\) passes the \(s\)-dimensional lattice test if the vectors \(\vec\eta_n- \vec\eta_0\) for \(n\geq 0\) span \(\mathbb F_q^s\), where \(\vec\eta_n= (\eta_n, \eta_{n+1},\dots, \eta_{n+s-1})\) for \(n\geq 0\). Moreover, the linear complexity \(L(\eta_n)\) of a sequence \(\eta_0, \eta_1,\dots, \) over \(\mathbb F_q\) means the least nonnegative integer \(L\) such that there are constants \(\gamma_0,\dots, \gamma_{L-1}\in \mathbb F_q\) satisfying \(\eta_{n+L}+ \gamma_{L-1} \eta_{n+L-1} +\cdots+ \gamma_0\eta_n= 0\) for all \(n\geq L\). The basic result of this paper is that the \(q\)-periodic sequence \(\eta_0, \eta_1,\dots\), over \(\mathbb F_q\) passes the \(s\)-dimensional lattice test if and only if \(s< L(\eta_n)\). The authors also give applications of this result to nonlinear and inverse pseudorandom number generators.
0 references
pseudorandom number generator
0 references
nonlinear method
0 references
inverse method
0 references
linear complexity
0 references
Marsaglia's lattice test
0 references