On the linear complexity profile of explicit nonlinear pseudorandom numbers. (Q1853169)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the linear complexity profile of explicit nonlinear pseudorandom numbers. |
scientific article |
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
