A simple algorithm for fast correlation attacks on stream ciphers
Författare
Summary, in English
A new simple algorithm for fast correlation attacks on stream ciphers is presented. The advantages of the new approach are at least two. Firstly, the new algorithm significantly reduces the memory requirements compared with some recent proposals [2],[3]. This allows more powerful attacks than previously. Secondly, the simplicity of the algorithm allows us to derive theoretical results. We determine the relation between the number of observed symbols, the correlation probability, and the allowed computational complexity, required for a successful attack. Hence, we can get theoretical estimates on the required computational complexity in cases when simulation is not possible.
Publiceringsår
2000
Språk
Engelska
Sidor
181-195
Publikation/Tidskrift/Serie
Fast Software Encryption / Lecture Notes in Computer Science
Volym
1978
Dokumenttyp
Konferensbidrag
Förlag
Springer
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Conference name
7th International Workshop, FSE 2000
Conference date
2000-04-10 - 2000-04-12
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 0302-9743
- ISSN: 1611-3349
- ISBN: 978-3-540-41728-6