A coding theoretic approach to attack certain stream ciphers
(1994) 1994 IEEE International Symposium on Information Theory, ISIT 1994 In IEEE International Symposium on Information Theory - Proceedings p.367-367- Abstract
We present a coding theoretic approach to the problem the initial state recovery of a linear feedback shift register when a noisy output sequence is given. Our work is focused on the investigation of the asymptotical behaviour of the recovery process. We give two algorithms which will work for shift registers with arbitrary feedback polynomial. Furthermore, the number of required given noisy symbols is close to its lower limit.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/272c55f4-6bf3-4c38-8954-748f05dfd6d2
- author
- Chepyzhov, Vladimir and Smeets, Ben LU
- organization
- publishing date
- 1994
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
- series title
- IEEE International Symposium on Information Theory - Proceedings
- article number
- 394651
- pages
- 1 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 1994 IEEE International Symposium on Information Theory, ISIT 1994
- conference location
- Trondheim, Norway
- conference dates
- 1994-06-27 - 1994-07-01
- external identifiers
-
- scopus:84894330982
- ISSN
- 2157-8095
- ISBN
- 0780320158
- 9780780320154
- DOI
- 10.1109/ISIT.1994.394651
- language
- English
- LU publication?
- yes
- id
- 272c55f4-6bf3-4c38-8954-748f05dfd6d2
- date added to LUP
- 2021-11-05 02:39:53
- date last changed
- 2021-11-08 15:44:09
@inproceedings{272c55f4-6bf3-4c38-8954-748f05dfd6d2, abstract = {{<p>We present a coding theoretic approach to the problem the initial state recovery of a linear feedback shift register when a noisy output sequence is given. Our work is focused on the investigation of the asymptotical behaviour of the recovery process. We give two algorithms which will work for shift registers with arbitrary feedback polynomial. Furthermore, the number of required given noisy symbols is close to its lower limit.</p>}}, author = {{Chepyzhov, Vladimir and Smeets, Ben}}, booktitle = {{Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994}}, isbn = {{0780320158}}, issn = {{2157-8095}}, language = {{eng}}, pages = {{367--367}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE International Symposium on Information Theory - Proceedings}}, title = {{A coding theoretic approach to attack certain stream ciphers}}, url = {{http://dx.doi.org/10.1109/ISIT.1994.394651}}, doi = {{10.1109/ISIT.1994.394651}}, year = {{1994}}, }