A new cryptanalytic time-memory trade-off for stream ciphers
CitationERGÜLER, İ., ANARIM, E. (2005). A new cryptanalytic time-memory trade-off for stream ciphers. In YOLUM, P. GÜNGÖR, T., GÜRGEN, F., ÖZTURAN, C. (eds.). Computer and Information Sciences - ISCIS 2005. Volume 3733, pp 215-223. http://dx.doi.org/10.1007/11569596_24.
In 1980 M. Hellman presented a cryptanalytic time-memory trade-off which reduces computational time by distributing possible key solution space N between memory M and time T, by using a pre-computed table, for block ciphers. This method was applied to stream ciphers by A. Biryukov and A. Shamir with consideration of known output data D. Recently, P. Oechslin described a technique which makes an improvement to Hellman's original idea in computational time with introducing the rainbow chain model for block ciphers. In this paper, we present the application of the rainbow chain model as a time-memory trade-off attack for stream ciphers.