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
Keyword: not much Memory,Birthday,MATHEMATICS,COMPUTER,FSB - Wagner,SHA-3
| Original language | English |
|---|---|
| Title of host publication | PROCEEDINGS OF PROGRESS IN CRYPTOLOGY - INDOCRYPT 2009 |
| Volume | Volume 5922 |
| Publisher | Springer Verlag, Berlin |
| Publication date | 2009 |
| Pages | 18-38 |
| ISBN (Print) | 978-36-42-10627-9 |
| DOIs | |
| Publication status | Published - 2009 |
| Externally published | Yes |
| Event | 10th International Conference on Cryptology in India - Indian National Science Academy, New Delhi, India Duration: 13 Dec 2009 → 16 Dec 2009 Conference number: 10 http://indocrypt09.inria.fr/ |
Conference
| Conference | 10th International Conference on Cryptology in India |
|---|---|
| Number | 10 |
| Location | Indian National Science Academy |
| Country/Territory | India |
| City | New Delhi |
| Period | 13/12/2009 → 16/12/2009 |
| Internet address |
| Series | Lecture Notes in Computer Science |
|---|
Fingerprint
Dive into the research topics of 'FSBday: Implementing Wagner's Generalized Birthday Attack against the SHA-3 Round-1 Candidate FSB'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver