Linear complexity of pseudorandom sequences based on summation of polynomial quotients (Q2927306)
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 6365275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear complexity of pseudorandom sequences based on summation of polynomial quotients |
scientific article; zbMATH DE number 6365275 |
Statements
3 November 2014
0 references
stream cipher
0 references
polynomial quotients
0 references
Fermat quotients
0 references
pseudorandom sequences
0 references
linear complexity
0 references
Linear complexity of pseudorandom sequences based on summation of polynomial quotients (English)
0 references
0.8718166351318359
0 references
0.8334017395973206
0 references
0.8188427090644836
0 references
0.8152176737785339
0 references
0.8016208410263062
0 references
