Advanced

A simple algorithm for fast correlation attacks on stream ciphers

Chepyshov, V.; Johansson, Thomas LU and Smeets, Ben LU (2000) 7th International Workshop, FSE 2000 In Fast Software Encryption / Lecture Notes in Computer Science 1978. p.181-195
Abstract
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Fast Software Encryption / Lecture Notes in Computer Science
volume
1978
pages
181 - 195
publisher
Springer
conference name
7th International Workshop, FSE 2000
ISSN
1611-3349
0302-9743
ISBN
978-3-540-41728-6
DOI
10.1007/3-540-44706-7_13
language
English
LU publication?
yes
id
9fee3698-abed-47f3-8900-0fc7d2b27967 (old id 1157352)
date added to LUP
2008-06-09 14:09:15
date last changed
2016-04-15 19:13:29
@inproceedings{9fee3698-abed-47f3-8900-0fc7d2b27967,
  abstract     = {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.},
  author       = {Chepyshov, V. and Johansson, Thomas and Smeets, Ben},
  booktitle    = {Fast Software Encryption / Lecture Notes in Computer Science},
  isbn         = {978-3-540-41728-6},
  issn         = {1611-3349},
  language     = {eng},
  pages        = {181--195},
  publisher    = {Springer},
  title        = {A simple algorithm for fast correlation attacks on stream ciphers},
  url          = {http://dx.doi.org/10.1007/3-540-44706-7_13},
  volume       = {1978},
  year         = {2000},
}