Linear complexity of binary sequences derived from polynomial quotients (Q2907289)
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: Linear complexity of binary sequences derived from polynomial quotients |
scientific article; zbMATH DE number 6079469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear complexity of binary sequences derived from polynomial quotients |
scientific article; zbMATH DE number 6079469 |
Statements
Linear Complexity of Binary Sequences Derived from Polynomial Quotients (English)
0 references
7 September 2012
0 references
Fermat quotients
0 references
polynomial quotients
0 references
finite fields
0 references
pseudorandom binary sequences
0 references
linear complexity
0 references
cryptography
0 references
0.913881242275238
0 references
0.903702199459076
0 references
0.8754922151565552
0 references
0.845694363117218
0 references
0.8345850110054016
0 references
