Paper 2009/292 Original: eprint.iacr.org/2009/292 ↗
Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB
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.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2011-09-27: last updated
- 2009-06-17: published
- Short URL
- https://ia.cr/2009/292
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/292,
author = {Daniel J. Bernstein and Tanja Lange and Ruben Niederhagen and Christiane Peters and Peter Schwabe},
title = {Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/292},
year = {2009},
url = {https://eprint.iacr.org/2009/292}
}