On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10623-012-9608-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981001466 / rank | |||
Normal rank | |||
Revision as of 18:55, 19 March 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
