Abstract
In this note we discuss a novel and simple time-memory tradeoff attack against the stream cipher LILI-128. The attack defeats the security advantage of having an irregular stepping function. The attack requires 246 bits of keystream, a lookup table of 245 89-bit words and computational effort which is roughly equivalent to 248 DES operations.
Chapter PDF
References
S. Babbage. Cryptanalysis of LILI-128. NESSIE Public Report, https://www.cosic.esat.kuleuven.ac.be/nessie/reports, 2001.
S. Babbage. A Space/Time Tradeoff in Exhaustive Search Attacks on Stream Ciphers, European Convention on Security and Detection, IEE Conference Publication No. 408, 1995.
A. Biryukov and A. Shamir, Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers, Proceedings of ASIACRYPT 2000, LNCS 1976, pp. 1–13, Springer-Verlag, 2000.
A. Biryukov, A. Shamir, and D. Wagner, Real Time Cryptanalysis of A5/1 on a PC, Proceedings of FSE’ 2000, LNCS 1978, pp. 1–18, Springer-Verlag, 2001.
E. Dawson, J. Golić, W. Millan and L. Simpson, The LILI-128 Keystream Generator, Proceedings of the Seventh Annual Workshop on Selected Areas in Cryptology—SAC 2000, LNCS 2012, Springer-Verlag, 2000.
E. Dawson, J. Golić, W. Millan and L. Simpson, Response to Initial Report on LILI-128, Submitted to Second NESSIE Workshop, 2001.
M. E. Hellmab, A Cryptanalytic Time-Memory Trade-Off, IEEE Transactions on Information Theory, Vol. IT-26, N 4, pp. 401–406, 1980.
F. Jönsson and T. Johansson, A Fast Correlation Attack on LILI-128., Information Processing Letters Vol 81, N. 3, Pages 127–132, 2001.
J. White, Initial Report on the LILI-128 Stream Cipher, NESSIE Public Report, https://www.cosic.esat.kuleuven.ac.be/nessie/reports, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saarinen, MJ.O. (2002). A Time-Memory Tradeoff Attack Against LILI-128. In: Daemen, J., Rijmen, V. (eds) Fast Software Encryption. FSE 2002. Lecture Notes in Computer Science, vol 2365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45661-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-45661-9_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44009-3
Online ISBN: 978-3-540-45661-2
eBook Packages: Springer Book Archive