On the linear complexity profile of explicit nonlinear pseudorandom numbers. (Q1853169)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1856499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the linear complexity profile of explicit nonlinear pseudorandom numbers. |
scientific article; zbMATH DE number 1856499 |
Statements
On the linear complexity profile of explicit nonlinear pseudorandom numbers. (English)
0 references
21 January 2003
0 references
Bounds on the linear complexity profile of a general explicit nonlinear pseudorandom number generator are obtained. For some special explicit nonlinear generators including the explicit inversive generator these results are improved.
0 references
Linear complexity profile
0 references
Explicit nonlinear pseudorandom number generator
0 references
Explicit inversive generator
0 references
Computational complexity
0 references
Cryptography
0 references
0 references
0 references
0 references
0.9673972
0 references
0.9416367
0 references
0.93346703
0 references
0.93127054
0 references
0.9292957
0 references
0.9277458
0 references
0.9207606
0 references
0.9193993
0 references
0.91931975
0 references
