Fast correlation attacks through reconstruction of linear polynomials

Thomas Johansson, Fredrik Jönsson

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingResearchpeer-review

90 Citations (SciVal)

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.
Original languageEnglish
Title of host publicationAdvances in Cryptology / Lecture Notes in Computer Science
PublisherSpringer
Pages300-315
Volume1880
ISBN (Print)978-3-540-67907-3
DOIs
Publication statusPublished - 2000
Event20th Annual International Cryptology Conference CRYPTO 2000 - Santa Barbara, California
Duration: 2000 Aug 202000 Aug 24

Publication series

Name
Volume1880
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th Annual International Cryptology Conference CRYPTO 2000
Period2000/08/202000/08/24

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'Fast correlation attacks through reconstruction of linear polynomials'. Together they form a unique fingerprint.

Cite this