On the linear complexity and lattice test of nonlinear pseudorandom number generators (Q2811672)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the linear complexity and lattice test of nonlinear pseudorandom number generators |
scientific article; zbMATH DE number 6592279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the linear complexity and lattice test of nonlinear pseudorandom number generators |
scientific article; zbMATH DE number 6592279 |
Statements
10 June 2016
0 references
pseudorandom sequences
0 references
linear complexity
0 references
lattice tests
0 references
On the linear complexity and lattice test of nonlinear pseudorandom number generators (English)
0 references
0.8825424313545227
0 references
0.8374993801116943
0 references
0.8128921389579773
0 references
0.812891960144043
0 references
0.810867965221405
0 references
