Fast correlation attacks through reconstruction of linear polynomials
(2000) 20th Annual International Cryptology Conference CRYPTO 2000 1880. p.300-315- Abstract
- The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the output sequence. We show that by modeling this problem as the problem of learning a binary linear multivariate polynomial, algorithms for polynomial reconstruction with queries can be modified through some general techniques used in fast correlation attacks. The result is a new and efficient way of performing fast correlation attacks.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1157354
- author
- Johansson, Thomas LU and Jönsson, Fredrik LU
- organization
- publishing date
- 2000
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Advances in Cryptology / Lecture Notes in Computer Science
- volume
- 1880
- pages
- 300 - 315
- publisher
- Springer
- conference name
- 20th Annual International Cryptology Conference CRYPTO 2000
- conference dates
- 2000-08-20 - 2000-08-24
- external identifiers
-
- scopus:84974625340
- ISSN
- 1611-3349
- 0302-9743
- ISBN
- 978-3-540-67907-3
- DOI
- 10.1007/3-540-44598-6_19
- language
- English
- LU publication?
- yes
- id
- fcf3150f-9799-426e-937a-a8935dd88526 (old id 1157354)
- date added to LUP
- 2016-04-01 12:04:17
- date last changed
- 2024-12-04 01:59:04
@inproceedings{fcf3150f-9799-426e-937a-a8935dd88526, abstract = {{The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the output sequence. We show that by modeling this problem as the problem of learning a binary linear multivariate polynomial, algorithms for polynomial reconstruction with queries can be modified through some general techniques used in fast correlation attacks. The result is a new and efficient way of performing fast correlation attacks.}}, author = {{Johansson, Thomas and Jönsson, Fredrik}}, booktitle = {{Advances in Cryptology / Lecture Notes in Computer Science}}, isbn = {{978-3-540-67907-3}}, issn = {{1611-3349}}, language = {{eng}}, pages = {{300--315}}, publisher = {{Springer}}, title = {{Fast correlation attacks through reconstruction of linear polynomials}}, url = {{http://dx.doi.org/10.1007/3-540-44598-6_19}}, doi = {{10.1007/3-540-44598-6_19}}, volume = {{1880}}, year = {{2000}}, }