An approximate distribution for the maximum order complexity (Q676727)
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 993505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximate distribution for the maximum order complexity |
scientific article; zbMATH DE number 993505 |
Statements
An approximate distribution for the maximum order complexity (English)
0 references
13 November 1997
0 references
This paper deals with the maximum order complexity of a finite binary sequence meant as the shortest feedback shift-register that can generate this sequence. In order to utilize this notion for cryptographic purposes, it is necessary to know about the distribution of the maximum order complexity for random sequences. Only a sequence with a large maximum order complexity may be used as a secure keystream. The paper presents a way to approximate the distribution of the maximum order complexity which leads to the construction of statistical tests for the randomness of a sequence. These tests are analogous to the tests based on linear complexity, if we require that the shortest feedback shift-register which generates a sequence is linear.
0 references
binary sequence
0 references
stream cipher
0 references
feedback shift-register
0 references
maximum order complexity
0 references
0 references
0.8683505
0 references
0 references
0.86210257
0 references
0.8602946
0 references
