Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

A simple algorithm for fast correlation attacks on stream ciphers

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


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering


7th International Workshop, FSE 2000
  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-540-41728-6

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen