Du är här

Fast correlation attacks through reconstruction of linear polynomials

Publiceringsår: 2000
Språk: Engelska
Sidor: 300-315
Publikation/Tidskrift/Serie: Advances in Cryptology / Lecture Notes in Computer Science
Volym: 1880
Dokumenttyp: Konferensbidrag
Förlag: Springer-Verlag


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.



  • Technology and Engineering


20th Annual International Cryptology Conference CRYPTO 2000
Santa Barbara, California
  • ISSN: 0302-9743
  • ISBN: 978-3-540-67907-3

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se


Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen