On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:23, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the linear complexity of binary threshold sequences derived from Fermat quotients |
scientific article |
Statements
On the linear complexity of binary threshold sequences derived from Fermat quotients (English)
0 references
6 May 2013
0 references
Fermat quotients
0 references
finite fields
0 references
binary sequences
0 references
linear complexity
0 references
cryptography
0 references
