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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Erguler, I., & Anarim, E. (2005). A new cryptanalytic time-memory trade-off for stream ciphers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3733 LNCS, pp. 215–223). https://doi.org/10.1007/11569596_24
Mendeley helps you to discover research relevant for your work.