Reduced complexity correlation attacks on two clock-controlled generators
(1998) International Conference on the Theory and Application of Cryptology and Information Security ASIACRYPT’98 1514. p.342-356- Abstract
- The Shrinking Generator and the Alternating Step Generator are two of the most well known clock-controlled stream ciphers. We consider correlation attacks on these two generators, based on an identified relation to the decoding problem for the deletion channel and the insertion channel, respectively. Several ways of reducing the decoding complexity are proposed and investigated, resulting in “divide-and-conquer” attacks on the two generators having considerably lower complexity than previously known attacks.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1157340
- author
- Johansson, Thomas LU
- organization
- publishing date
- 1998
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Advances in Cryptology / Lecture Notes in Computer Science
- volume
- 1514
- pages
- 342 - 356
- publisher
- Springer
- conference name
- International Conference on the Theory and Application of Cryptology and Information Security ASIACRYPT’98
- conference location
- Beijing, China
- conference dates
- 1998-10-18 - 1998-10-22
- external identifiers
-
- scopus:84947776392
- ISSN
- 0302-9743
- 1611-3349
- ISBN
- 978-3-540-65109-3
- DOI
- 10.1007/3-540-49649-1_27
- language
- English
- LU publication?
- yes
- id
- 14999a2b-a5db-4a7b-9c95-84826a987b9b (old id 1157340)
- date added to LUP
- 2016-04-01 11:37:57
- date last changed
- 2024-01-07 14:36:08
@inproceedings{14999a2b-a5db-4a7b-9c95-84826a987b9b, abstract = {{The Shrinking Generator and the Alternating Step Generator are two of the most well known clock-controlled stream ciphers. We consider correlation attacks on these two generators, based on an identified relation to the decoding problem for the deletion channel and the insertion channel, respectively. Several ways of reducing the decoding complexity are proposed and investigated, resulting in “divide-and-conquer” attacks on the two generators having considerably lower complexity than previously known attacks.}}, author = {{Johansson, Thomas}}, booktitle = {{Advances in Cryptology / Lecture Notes in Computer Science}}, isbn = {{978-3-540-65109-3}}, issn = {{0302-9743}}, language = {{eng}}, pages = {{342--356}}, publisher = {{Springer}}, title = {{Reduced complexity correlation attacks on two clock-controlled generators}}, url = {{http://dx.doi.org/10.1007/3-540-49649-1_27}}, doi = {{10.1007/3-540-49649-1_27}}, volume = {{1514}}, year = {{1998}}, }