The fast correlation attack based on iterative probabilistic decoding is applied to nonlinear filter generators in order to investigate the effect of multiple linear transforms of the same linear recurring sequence being correlated to the keystream sequence. Systematic experimental results on random
A fast correlation attack on LILI-128
✍ Scribed by Fredrik Jönsson; Thomas Johansson
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 90 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we demonstrate a fast correlation attack on the recently proposed stream cipher LILI-128. The attack has complexity around 2 71 bit operations assuming a received sequence of length around 2 30 bits and a precomputation phase of complexity 2 79 table lookups. This complexity is significantly lower than 2 112 , which was conjectured by the inventors of LILI-128 to be a lower bound on the complexity of any attack.
📜 SIMILAR VOLUMES
A statistical approach to cryptanalysis of a memoryless function of clock-controlled shift registers is introduced. In the case of zero-order correlation immunity, an algorithm for a shift register initial state reconstruction based on the sequence comparison concept is proposed. A constrained Leven