An Efficient State Recovery Attack on X-FCSR-256

Authors:
Paul Stankovski;Martin Hell;Thomas Johansson
Affiliations:
Dept. of Electrical and Information Technology, Lund University, Lund, Sweden 221 00;Dept. of Electrical and Information Technology, Lund University, Lund, Sweden 221 00;Dept. of Electrical and Information Technology, Lund University, Lund, Sweden 221 00
Venue:
Fast Software Encryption
Year:
2009

Citing 0
Cited 3

Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
A matrix approach for FCSR automata

Cryptography and Communications
The GLUON family: a lightweight hash function family based on FCSRs

AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a state recovery attack on the X-FCSR-256 stream cipher of total complexity at most 257.6. This complexity is achievable by requiring 249.3 output blocks with an amortized calculation effort of at most 28.3 table lookups per output block using no more than 233 table entries of precomputational storage.