Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 3127-3144 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 53 |
| Issue number | 9 |
| Publication status | Published - 2007 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering
Free keywords
- advantage
- distinguishing attack
- Scream
- linear cryptanalysis