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.

Reduced complexity correlation attacks on two clock-controlled generators

In English

Författare

Summary, in English

The Shrinking Generator and the Alternating Step Generator are two of the most well known clock-controlled stream ciphers. We consider correlation attacks on these two generators, based on an identified relation to the decoding problem for the deletion channel and the insertion channel, respectively. Several ways of reducing the decoding complexity are proposed and investigated, resulting in “divide-and-conquer” attacks on the two generators having considerably lower complexity than previously known attacks.

Publiceringsår

1998

Språk

Engelska

Sidor

342-356

Publikation/Tidskrift/Serie

Advances in Cryptology / Lecture Notes in Computer Science

Volym

1514

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

International Conference on the Theory and Application of Cryptology and Information Security ASIACRYPT’98

Conference date

1998-10-18 - 1998-10-22

Conference place

Beijing, China

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-540-65109-3