Sciweavers

ASIACRYPT
2000
Springer

Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers

14 years 2 months ago
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM2 = N2 for 1 T N. Recently, Babbage and Golic pointed out that a different TM = N tradeoff attack for 1 T D is applicable to stream ciphers, where D is the amount of output data available to the attacker. In this paper we show that a combination of the two approaches has an improved time/memory/data tradeoff for stream ciphers of the form TM2 D2 = N2 for any D2 T N. In addition, we show that stream ciphers with low sampling resistance have tradeoff attacks with fewer table lookups and a wider choice of parameters.
Alex Biryukov, Adi Shamir
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where ASIACRYPT
Authors Alex Biryukov, Adi Shamir
Comments (0)