Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences (Q1842605)
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: Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences |
scientific article; zbMATH DE number 750798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences |
scientific article; zbMATH DE number 750798 |
Statements
Analysis of \((k_ 0,k_ 1)\) clock-controlled sequences (English)
0 references
8 May 1996
0 references
The paper deals with nets of feedback shift-registers in which a linear shift-register is clock controlled in a pseudorandom manner by another register. The necessary and sufficient condition for the maximal linear complexity and the maximal period of the sequences generated by such nets are given and statistical properties are discussed. Because of weaknesses in the security of the cryptographic system two kinds of improved models having better statistical properties are proposed. The authors analyse the ability of the new nets of resisting the algebraic attacks.
0 references
cryptography
0 references
linear shift-register sequences
0 references
nets of feedback shift- registers
0 references
maximal linear complexity
0 references
maximal period
0 references
0 references
0 references
