Improved Cryptanalysis of the Self-Shrinking Generator

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2001

Not written here

  • Author: Zenner, Erik

    Unknown

  • Author: Krause, Matthias

  • Author: Lucks, Stefan

View graph of relations

We propose a new attack on the self-shrinking generator [8]. The attack is based on a backtracking algorithm and will reconstruct the key from a short sequence of known keystream bits. We give both mathematical and empirical evidence for the effectiveness of this attack. The algorithm takes at most O(2^0.694L) steps, where L is the key length. Thus, our attack is more efficient than previously known key reconstruction algorithms against the self-shrinking generator that operate on short keystream sequences.
Original languageEnglish
TitleProceedings ACISP 2001
EditorsVijay Varadharajan, Yi Mu
Place of publicationLondon, UK
PublisherSpringer-Verlag
Publication date2001
Pages21-35
ISBN (print)3-540-42300-1
StatePublished

Conference

ConferenceAustralasian Conference on Information Security and Privacy
Number6
CitySydney, AU
Period01/01/01 → …
NameLecture Notes in Computer Science
Number2119
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 2671860