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
Conference paper

DOI: 10.1007/978-3-642-10628-6_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5922)
Cite this paper as:
Bernstein D.J., Lange T., Niederhagen R., Peters C., Schwabe P. (2009) FSBday. In: Roy B., Sendrier N. (eds) Progress in Cryptology - INDOCRYPT 2009. INDOCRYPT 2009. Lecture Notes in Computer Science, vol 5922. Springer, Berlin, Heidelberg

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.

Keywords

SHA-3 Birthday FSB – Wagner not much Memory 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Daniel J. Bernstein
    • 1
  • Tanja Lange
    • 2
  • Ruben Niederhagen
    • 3
  • Christiane Peters
    • 2
  • Peter Schwabe
    • 2
  1. 1.Department of Computer ScienceUniversity of Illinois at ChicagoChicagoUSA
  2. 2.Department of Mathematics and Computer ScienceTechnische Universiteit EindhovenEindhovenNetherlands
  3. 3.Lehrstuhl für BetriebssystemeRWTH Aachen UniversityAachenGermany

Personalised recommendations