Fast correlation attacks through reconstruction of linear polynomials

Summary, in English

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.

• Författare: Thomas Johansson; Fredrik Jönsson
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2000
• Språk: Engelska
• Sidor: 300-315
• Publikation/Tidskrift/Serie: Advances in Cryptology / Lecture Notes in Computer Science
• Volym: 1880
• Länkar: http://dx.doi.org/10.1007/3-540-44598-6_19
• Dokumenttyp: Konferensbidrag
• Förlag: Springer
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: 20th Annual International Cryptology Conference CRYPTO 2000
• Conference date: 2000-08-20 - 2000-08-24
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 1611-3349; ISSN: 0302-9743; ISBN: 978-3-540-67907-3