Sammanfattning
In this paper we demonstrate a fast correlation attack on the recently proposed stream cipher LILI-128. The attack has complexity around 271 bit operations assuming a received sequence of length around 230 bits and a precomputation phase of complexity 279 table lookups. This complexity is significantly lower than 2112, which was conjectured by the inventors of LILI-128 to be a lower bound on the complexity of any attack.
Originalspråk | Engelska |
---|---|
Sidor (från-till) | 127-132 |
Antal sidor | 6 |
Tidskrift | Information Processing Letters |
Volym | 81 |
Nummer | 3 |
DOI | |
Status | Publicerad - 2002-feb.-14 |
Externt publicerad | Ja |
Nationell ämneskategori
- Elektroteknik och elektronik (202)