Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers

By Alex Biryukov, Adi Shamir. International Conference on the Theory and Application of Cryptology and Information Security, 2000

424 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The Secure Real-time Transport Protocol (SRTP) (2004, methodology): “* "Salting keys" are used to protect against pre-computation and time-memory tradeoff attacks [MF00] [ BS00 ].”
Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication (2003, methodology): “Note that it is possible to reduce the number of disk accesses using A5/1’s low sampling resistance (see [5,6] for details).”
A Stream Cipher Proposal: Grain-128 (2006, background): “They were introduced in [12] and have shown to be efficient against many known stream cipher constructions.”
Grain: a stream cipher for constrained environments (2007, neutral): “where n is the number of inner states of the stream cipher, [ 3 ].”
Algebraic Attacks on Stream Ciphers with Linear Feedback (2003, background): “Similarly, if the keystream available is limited to 217, both the attack from [19] and [24] will require a precomputation of about 2111.”