The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Reduced complexity correlation attacks on two clock-controlled generators

På svenska

Author

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.

Publishing year

1998

Language

English

Pages

342-356

Publication/Series

Advances in Cryptology / Lecture Notes in Computer Science

Volume

1514

Document type

Conference paper

Publisher

Springer

Topic

  • 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/Other

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