Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus (Q5859634)
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 threshold sequences derived from generalized polynomial quotient with prime-power modulus |
scientific article; zbMATH DE number 7334813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus |
scientific article; zbMATH DE number 7334813 |
Statements
Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus (English)
0 references
19 April 2021
0 references
Euler quotient
0 references
Legendre function
0 references
pseudorandom binary sequences
0 references
linear complexity
0 references
cryptography
0 references
0 references
0 references
0 references
0.903702199459076
0 references
0.8854287266731262
0 references
0.8590785264968872
0 references
0.851739764213562
0 references
