Fast correlation attacks through reconstruction of linear polynomials

Thomas Johansson, Fredrik Jönsson

Forskningsoutput: Kapitel i bok/rapportKapitel i bokPeer review

108 Citeringar (Scopus)

Sammanfattning

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.

OriginalspråkEngelska
Titel på värdpublikationAdvances in Cryptology - CRYPTO 2000
Undertitel på värdpublikation20th Annual International Cryptology Conference
RedaktörerMihir Bellare
FörlagSpringer Verlag
Sidor300-315
Antal sidor16
ISBN (elektroniskt)9783540445982
ISBN (tryckt)978-3-540-44598-2
DOI
StatusPublicerad - 2000
Externt publiceradJa
Evenemang20th Annual International Cryptology Conference, CRYPTO 2000 - Santa Barbara, USA
Varaktighet: 2000-aug.-202000-aug.-24

Publikationsserier

NamnLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volym1880
ISSN (tryckt)0302-9743
ISSN (elektroniskt)1611-3349

Konferens

Konferens20th Annual International Cryptology Conference, CRYPTO 2000
Land/TerritoriumUSA
OrtSanta Barbara
Period00-08-2000-08-24

Fingeravtryck

Fördjupa i forskningsämnen för ”Fast correlation attacks through reconstruction of linear polynomials”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här