Publication: Research - peer-review › Article in proceedings – Annual report year: 2001
We propose a new attack on the self-shrinking generator . 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.
|Title||Proceedings ACISP 2001|
|Editors||Vijay Varadharajan, Yi Mu|
|Place of publication||London, UK|
|Conference||Australasian Conference on Information Security and Privacy|
|Period||01/01/01 → …|
|Name||Lecture Notes in Computer Science|
Loading map data...