Linear complexity of binary sequences derived from Euler quotients with prime-power modulus (Q436622)
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 sequences derived from Euler quotients with prime-power modulus |
scientific article; zbMATH DE number 6059717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear complexity of binary sequences derived from Euler quotients with prime-power modulus |
scientific article; zbMATH DE number 6059717 |
Statements
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus (English)
0 references
25 July 2012
0 references
Euler quotients
0 references
Fermat quotients
0 references
pseudorandom binary sequences
0 references
linear complexity
0 references
cryptography
0 references
0 references
0 references
