Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus (Q5859634): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054120500264 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3082410105 / rank | |||
Normal rank | |||
Latest revision as of 09:54, 30 July 2024
scientific article; zbMATH DE number 7334813
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
