Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Predicting the shrinking generator with fixed connections

Författare

Summary, in English

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.

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

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

EUROCRYPT 2003: International Conference on the Theory and Applications of Cryptographic Techniques

Conference date

2003-05-04 - 2003-05-08

Conference place

Warsaw, Poland

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1611-3349
  • ISSN: 0302-9743