Fault Attacks on Stream Cipher Scream
In this paper we present a differential fault attack (DFA) on the stream cipher Scream which is designed by the IBM researchers Coppersmith, Halevi, and Jutla in 2002. The known linear distinguishing attack on Scream takes 2120 output words and there is no key recovery attack on it, since the S-box used by Scream is key-dependent and complex. Under the assumption that we can inject random byte faults in the same location multiple number of times, the 128-bit key can be recovered with 294 computations and 272 bytes memory by injecting around 2000 faults. Then combined with the assumption of related key attacks, we can retrieve the key with 244 computations and 240 bytes memory. The result is verified by experiments. To the best of the our knowledge this is the first DFA and key recovery attack on Scream.
KeywordsFault Attacks Scream Key-dependent S-box Stream Cipher
Unable to display preview. Download preview PDF.
- Alexander, M., Thomas, J.: A Linear Distinguishing Attack on Scream. IEEE Transaction on Information Theory 53(9) (2007)Google Scholar
- Berzati, A., Canovas, C., Castagnos, G., Debraize, B., Goubin, L., Gouget, A., Paillier, P., Salgado, S.: Fault Analysis of Grain-128. In: IEEE International Work-shop on Hardware-Oriented Security and Trust, pp. 7–14 (2009)Google Scholar
- Tsunoo, Y., Saito, T., Kubo, H., Suzaki, T.: Cryptanalysis of Mir-1: A T-Function-Based Stream Cipher. IEEE Transaction on Information Theory 53(11) (2007)Google Scholar