Sammanfattning
In this paper we present a new algorithm for the recovery of the initial state of a linear feedback shift register when a noisy output sequence is given. Our work is focussed on the investigation of the asymptotical behaviour of the recovery process rather than on the construction of an optimal recovery procedure. Our results show the importance of low-weight checks and show also that the complexity of the recovery problem grows less than exponentially with the length of the shift register, even if the number of taps grows linearly with the register length. Our procedure works for shift register with arbitrary feedback polynomial.
Originalspråk | engelska |
---|---|
Titel på värdpublikation | Advances in Cryptology—EUROCRYPT 1991 |
Undertitel på värdpublikation | Workshop on the Theory and Application of Cryptographic Techniques, Proceedings |
Redaktörer | Donald W. Davies |
Förlag | Springer |
Sidor | 176-185 |
Antal sidor | 10 |
ISBN (elektroniskt) | 9783540464167 |
ISBN (tryckt) | 9783540546207 |
DOI | |
Status | Published - 1991 |
Evenemang | Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991 - Brighton, Storbritannien Varaktighet: 1991 apr. 8 → 1991 apr. 11 |
Publikationsserier
Namn | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volym | 547 LNCS |
ISSN (tryckt) | 0302-9743 |
ISSN (elektroniskt) | 1611-3349 |
Konferens
Konferens | Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991 |
---|---|
Land/Territorium | Storbritannien |
Ort | Brighton |
Period | 1991/04/08 → 1991/04/11 |
Bibliografisk information
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1991.
Ämnesklassifikation (UKÄ)
- Datavetenskap (datalogi)
- Reglerteknik