FSBday: Implementing Wagner's Generalized Birthday Attack against the SHA-3 Round-1 Candidate FSB

Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

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 FSB48, 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.
Keyword: not much Memory,Birthday,MATHEMATICS,COMPUTER,FSB - Wagner,SHA-3
Original languageEnglish
Title of host publicationPROCEEDINGS OF PROGRESS IN CRYPTOLOGY - INDOCRYPT 2009
VolumeVolume 5922
PublisherSpringer Verlag, Berlin
Publication date2009
Pages18-38
ISBN (Print)978-36-42-10627-9
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event10th International Conference on Cryptology in India - Indian National Science Academy, New Delhi, India
Duration: 13 Dec 200916 Dec 2009
Conference number: 10
http://indocrypt09.inria.fr/

Conference

Conference10th International Conference on Cryptology in India
Number10
LocationIndian National Science Academy
CountryIndia
CityNew Delhi
Period13/12/200916/12/2009
Internet address
SeriesLecture Notes in Computer Science

Cite this

Bernstein, D. J., Lange, T., Niederhagen, R., Peters, C., & Schwabe, P. (2009). FSBday: Implementing Wagner's Generalized Birthday Attack against the SHA-3 Round-1 Candidate FSB. In PROCEEDINGS OF PROGRESS IN CRYPTOLOGY - INDOCRYPT 2009 (Vol. Volume 5922, pp. 18-38). Springer Verlag, Berlin. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-642-10628-6_2