A linear distinguishing attack on SCREAM
Research output: Contribution to journal › Article
A linear distinguishing attack on the stream cipher Scream is proposed. When the keystream is of length 2(98) words, the distinguisher has a detectable advantage. When the keystream length is around 2(120) the advantage is very close to 1. This shows certain weaknesses of Scream. In the process, the paper introduces new general ideas on how to improve the performance of linear distinguishing attacks on stream ciphers.
|Research areas and keywords||
Subject classification (UKÄ) – MANDATORY
|Journal||IEEE Transactions on Information Theory|
|Publication status||Published - 2007|