Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Predicting the shrinking generator with fixed connections

Författare:
Publiceringsår: 2003
Språk: Engelska
Sidor: 330-344
Publikation/Tidskrift/Serie: Advances in Cryptology / Lecture Notes in Computer Science
Volym: 2656
Dokumenttyp: Konferensbidrag
Förlag: Springer Berlin / Heidelberg

Sammanfattning

We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking generator with a weight 4 polynomial of degree as large as 10000, using 2(32) output bits. As the feedback polynomial of an arbitrary LFSR is known to have a polynomial multiple of low weight, our distinguisher applies to arbitrary shrunken LFSR's of moderate length. The analysis can also be used to predict the distribution of blocks in the generated keystream.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

EUROCRYPT 2003: International Conference on the Theory and Applications of Cryptographic Techniques
2014-05-05
Warsaw, Poland
Published
Yes
  • ISSN: 0302-9743

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