2009 | OriginalPaper | Chapter
An Efficient State Recovery Attack on X-FCSR-256
Authors : Paul Stankovski, Martin Hell, Thomas Johansson
Published in: Fast Software Encryption
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We describe a state recovery attack on the X-FCSR-256 stream cipher of total complexity at most 2
57.6
. This complexity is achievable by requiring 2
49.3
output blocks with an amortized calculation effort of at most 2
8.3
table lookups per output block using no more than 2
33
table entries of precomputational storage.