TY - GEN
T1 - A simple algorithm for fast correlation attacks on stream ciphers
AU - Chepyshov, V.
AU - Johansson, Thomas
AU - Smeets, Ben
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
U2 - 10.1007/3-540-44706-7_13
DO - 10.1007/3-540-44706-7_13
M3 - Paper in conference proceeding
SN - 978-3-540-41728-6
VL - 1978
SP - 181
EP - 195
BT - Fast Software Encryption / Lecture Notes in Computer Science
PB - Springer
T2 - 7th International Workshop, FSE 2000
Y2 - 10 April 2000 through 12 April 2000
ER -