FSBday : Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB

D.J. Bernstein; T. Lange; R.F. Niederhagen; C.P. Peters; P. Schwabe

FSBday : Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB

D.J. Bernstein
, T. Lange
, R.F. Niederhagen
, C.P. Peters
, P. Schwabe

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Downloads (Pure)

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.

Original language	English
Title of host publication	SHARCS'09 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems, Lausanne, Switzerland, September 9-10, 2009)
Pages	85-104
Publication status	Published - 2009

Access to Document

http://www.hyperelliptic.org/tanja/SHARCS/record2.pdf

Cite this

Bernstein, D. J., Lange, T., Niederhagen, R. F., Peters, C. P., & Schwabe, P. (2009). FSBday : Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB. In SHARCS'09 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems, Lausanne, Switzerland, September 9-10, 2009) (pp. 85-104) http://www.hyperelliptic.org/tanja/SHARCS/record2.pdf

@inproceedings{9b31ef5196a14f12be129d3f04f705dc,

title = "FSBday : 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.",

author = "D.J. Bernstein and T. Lange and R.F. Niederhagen and C.P. Peters and P. Schwabe",

year = "2009",

language = "English",

pages = "85--104",

booktitle = "SHARCS'09 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems, Lausanne, Switzerland, September 9-10, 2009)",

}

Bernstein, DJ, Lange, T, Niederhagen, RF, Peters, CP & Schwabe, P 2009, FSBday : Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB. in SHARCS'09 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems, Lausanne, Switzerland, September 9-10, 2009). pp. 85-104. <http://www.hyperelliptic.org/tanja/SHARCS/record2.pdf>

FSBday : Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB. / Bernstein, D.J.; Lange, T.; Niederhagen, R.F. et al.
SHARCS'09 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems, Lausanne, Switzerland, September 9-10, 2009). 2009. p. 85-104.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - FSBday : Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB

AU - Bernstein, D.J.

AU - Lange, T.

AU - Niederhagen, R.F.

AU - Peters, C.P.

AU - Schwabe, P.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 85

EP - 104

BT - SHARCS'09 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems, Lausanne, Switzerland, September 9-10, 2009)

ER -

FSBday : Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB

Abstract

Access to Document

Fingerprint

Cite this