Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations (Q437681)
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 6058201
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations |
scientific article; zbMATH DE number 6058201 |
Statements
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations (English)
0 references
18 July 2012
0 references
cryptography
0 references
Fermat quotients
0 references
polynomial quotients
0 references
finite fields
0 references
pseudorandom sequences
0 references
linear complexity
0 references
0.94226855
0 references
0.9375078
0 references
0.9221699
0 references
0.9163648
0 references
0.91041714
0 references
0.9073206
0 references
0.8997265
0 references
