FSBday: implementing Wagner’s generalized birthday attack against the SHA-3 round-1 candidate FSB. (English) Zbl 1248.94055

Roy, Bimal (ed.) et al., Progress in cryptology – INDOCRYPT 2009. 10th international conference on cryptology in India, New Delhi, India, December 13–16, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10627-9/pbk). Lecture Notes in Computer Science 5922, 18-38 (2009).
Summary: This paper applies generalized birthday attacks to the FSB compression function, and shows how to adapt the attacks so that they run in far less memory. In particular, this paper presents details of a parallel implementation attacking FSB\(_{48}\), a scaled-down version of FSB proposed by the FSB submitters. The implementation runs on a cluster of 8 PCs, each with only 8GB of RAM and 700GB of disk. This situation is very interesting for estimating the security of systems against distributed attacks using contributed off-the-shelf PCs.
For the entire collection see [Zbl 1178.94007].


94A60 Cryptography
68W10 Parallel algorithms in computer science
68W15 Distributed algorithms
Full Text: DOI