A simple algorithm for fast correlation attacks on stream ciphers
(2000) 7th International Workshop, FSE 2000 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:
https://lup.lub.lu.se/record/1157352
- author
- Chepyshov, V. ; Johansson, Thomas LU and Smeets, Ben LU
- organization
- publishing date
- 2000
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Fast Software Encryption / Lecture Notes in Computer Science
- volume
- 1978
- pages
- 181 - 195
- publisher
- Springer
- conference name
- 7th International Workshop, FSE 2000
- conference dates
- 2000-04-10 - 2000-04-12
- external identifiers
-
- scopus:84969367308
- 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
- 2016-04-01 11:52:05
- date last changed
- 2024-12-03 18:22:48
@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}}, doi = {{10.1007/3-540-44706-7_13}}, volume = {{1978}}, year = {{2000}}, }