Meny

Du är här

Correlation attacks using a new class of weak feedback polynomials

Författare:
Publiceringsår: 2004
Språk: Engelska
Sidor: 127-142
Publikation/Tidskrift/Serie: Fast Software Encryption. Revised Papers / Lecture Notes in Computer Science
Volym: 3017
Dokumenttyp: Konferensbidrag
Förlag: Springer Berlin / Heidelberg

Sammanfattning

In 1985 Siegenthaler introduced the concept of correlation attacks on LFSR based stream ciphers. A few years later Meier and Staffelbach demonstrated a special technique, usually referred to as fast correlation attacks, that is very effective if the feedback polynomial has a special form, namely, if its weight is very low. Due to this seminal result, it is a well known fact that one avoids low weight feedback polynomials in the design of LFSR based stream ciphers. This paper identifies a new class of such weak feedback polynomials, polynomials of the form f(x) = g(1) (x) + g(2) (x)x(M1) + (...) + g(t)(x)x(Mt-1), where g(1), g(2), (...), g(t) are all polynomials of low degree. For such feedback polynomials, we identify an efficient correlation attack in the form of a distinguishing attack.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

11th International Workshop, FSE 2004
2014-02-06
Delhi, India
Published
Yes
  • ISSN: 0302-9743
  • ISBN: 978-3-540-22171-5

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