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.
SHA-2 will soon retire; see [10].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
MPICH2: High-performance and widely portable MPI, http://www.mcs.anl.gov/research/projects/mpich2/ (accessed 08-18-2009)
Augot, D., Finiasz, M., Gaborit, P., Manuel, S., Sendrier, N.: SHA-3 Proposal: FSB (2009), http://www-rocq.inria.fr/secret/CBCrypto/index.php?pg=fsb
Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function (2003), http://eprint.iacr.org/2003/230
Augot, D., Finiasz, M., Sendrier, N.: A family of fast syndrome based cryptographic hash functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 64–83. Springer, Heidelberg (2005)
Barreto, P.S.L.M., Rijmen, V.: The WHIRLPOOL Hashing Function, http://www.larc.usp.br/~pbarreto/WhirlpoolPage.html
Bernstein, D.J.: Better price-performance ratios for generalized birthday attacks. In: Workshop Record of SHARCS ’07: Special-purpose Hardware for Attacking Cryptographic Systems (2007), http://cr.yp.to/papers.html#genbday
Coron, J.-S., Joux, A.: Cryptanalysis of a provably secure cryptographic hash function (2004), http://eprint.iacr.org/2004/013
Knuth, D.E.: The Art of Computer Programming. vol. 2, Seminumerical Algorithms, 3rd edn. Addison-Wesley Publishing Co., Reading (1997)
Minder, L., Sinclair, A.: The extended k-tree algorithm. In: Mathieu, C. (ed.) SODA, pp. 586–595. SIAM, Philadelphia (2009)
Naehrig, M., Peters, C., Schwabe, P.: SHA-2 will soon retire (to appear), http://cryptojedi.org/users/peter/index.shtml#retire
Wagner, D.: A generalized birthday problem (extended abstract). In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288–304. Springer, Heidelberg (2002), See also newer version [12], http://www.cs.berkeley.edu/~daw/papers/genbday.html
Wagner, D.: A generalized birthday problem (extended abstract) (long version), See also older version [11] (2002), http://www.cs.berkeley.edu/~daw/papers/genbday.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-10628-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-10628-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10627-9
Online ISBN: 978-3-642-10628-6
eBook Packages: Computer ScienceComputer Science (R0)