FSBday

Authors:
Daniel J. Bernstein;Tanja Lange;Ruben Niederhagen;Christiane Peters;Peter Schwabe
Affiliations:
Department of Computer Science, University of Illinois at Chicago, Chicago, USA 60607---7045;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, Netherlands 5600;Lehrstuhl für Betriebssysteme, RWTH Aachen University, Aachen, Germany 52056;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, Netherlands 5600;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, Netherlands 5600
Venue:
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Year:
2009

Citing 4
Cited 2

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A Generalized Birthday Problem

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
The extended k-tree algorithm

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A family of fast syndrome based cryptographic hash functions

Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia

Faster 2-regular information-set decoding

IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Really fast syndrome-based hashing

AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa

Quantified Score

Hi-index	0.00

Visualization

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.