SecurID is a widely used hardware token for strengthening authentication in a corporate environment. Recently, Biryukov, Lano, and Preneel presented an attack on the alleged SecurID hash function. They showed that vanishing differentials – collisions of the hash function – occur quite frequently, and that such differentials allow an attacker to recover the secret key in the token much faster than exhaustive search. Based on simulation results, they estimated that the running time of their attack would be about 248 full hash operations when using only a single 2-bit vanishing differential.
In this paper, we present techniques to improve the attack. Our theoretical analysis and implementation experiments show that the running time of our improved attack is about 245 hash operations. We then investigate into the use of extra information that an attacker would typically have: multiple vanishing differentials or knowledge that other vanishing differentials do not occur in a nearby time period. When using the extra information, we believe that key recovery can always be accomplished within about 240 hash operations.
|Name||Lecture notes in computer science|
|Workshop||International Workshop, Fast Software Encryption (11th : 2004)|
|Period||5/02/04 → 7/02/04|