Cryptanalysis of the alleged SecurID hash function

Abstract

The SecurID hash function is used for authenticating users to a corporate computer infrastructure. We analyse an alleged implementation of this hash function. The block cipher at the heart of the function can be broken in few milliseconds on a PC with 70 adaptively chosen plaintexts. The 64-bit secret key of 10% of the cards can be discovered given two months of token outputs and 248 analysis steps. A larger fraction of cards can be covered given more observation time. © Springer-Verlag Berlin Heidelberg 2004.