Really fast syndrome-based hashing

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

Not written here

Standard

Really fast syndrome-based hashing. / Bernstein, Daniel J.; Lange, Tanja; Peters, Christiane; Schwabe, Peter.

Progress in Cryptology: 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings. ed. / Abderrahmane Nitaj; David Pointcheval. Springer, 2011. p. 134-152 (Lecture Notes in Computer Science; No. 6767).

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

Harvard

Bernstein, DJ, Lange, T, Peters, C & Schwabe, P 2011, 'Really fast syndrome-based hashing'. in A Nitaj & D Pointcheval (eds), Progress in Cryptology: 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings. Springer, pp. 134-152. Lecture Notes in Computer Science, no. 6767, , 10.1007/978-3-642-21969-6_9

APA

Bernstein, D. J., Lange, T., Peters, C., & Schwabe, P. (2011). Really fast syndrome-based hashing. In A. Nitaj, & D. Pointcheval (Eds.), Progress in Cryptology: 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings. (pp. 134-152). Springer. (Lecture Notes in Computer Science; No. 6767). 10.1007/978-3-642-21969-6_9

CBE

Bernstein DJ, Lange T, Peters C, Schwabe P. 2011. Really fast syndrome-based hashing. Nitaj A, Pointcheval D, editors. In Progress in Cryptology: 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings. Springer. pp. 134-152. (Lecture Notes in Computer Science; No. 6767). Available from: 10.1007/978-3-642-21969-6_9

MLA

Bernstein, Daniel J. et al. "Really fast syndrome-based hashing". and Nitaj, Abderrahmane Pointcheval, David (ed.). Progress in Cryptology: 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings. Springer. 2011. 134-152. (Lecture Notes in Computer Science; Journal number 6767). Available: 10.1007/978-3-642-21969-6_9

Vancouver

Bernstein DJ, Lange T, Peters C, Schwabe P. Really fast syndrome-based hashing. In Nitaj A, Pointcheval D, editors, Progress in Cryptology: 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings. Springer. 2011. p. 134-152. (Lecture Notes in Computer Science; No. 6767). Available from: 10.1007/978-3-642-21969-6_9

Author

Bernstein, Daniel J.; Lange, Tanja; Peters, Christiane; Schwabe, Peter / Really fast syndrome-based hashing.

Progress in Cryptology: 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011. Proceedings. ed. / Abderrahmane Nitaj; David Pointcheval. Springer, 2011. p. 134-152 (Lecture Notes in Computer Science; No. 6767).

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

Bibtex

@inbook{869d7c9846e44cf79d164b6f46d7e142,
title = "Really fast syndrome-based hashing",
publisher = "Springer",
author = "Bernstein, {Daniel J.} and Tanja Lange and Christiane Peters and Peter Schwabe",
year = "2011",
doi = "10.1007/978-3-642-21969-6_9",
editor = "Abderrahmane Nitaj and David Pointcheval",
isbn = "978-3-642-21968-9",
series = "Lecture Notes in Computer Science",
pages = "134-152",
booktitle = "Progress in Cryptology",

}

RIS

TY - GEN

T1 - Really fast syndrome-based hashing

A1 - Bernstein,Daniel J.

A1 - Lange,Tanja

A1 - Peters,Christiane

A1 - Schwabe,Peter

AU - Bernstein,Daniel J.

AU - Lange,Tanja

AU - Peters,Christiane

AU - Schwabe,Peter

PB - Springer

PY - 2011

Y1 - 2011

N2 - The FSB (fast syndrome-based) hash function was submitted to the SHA-3 competition by Augot, Finiasz, Gaborit, Manuel, and Sendrier in 2008, after preliminary designs proposed in 2003, 2005, and 2007. Many FSB parameter choices were broken by Coron and Joux in 2004, Saarinen in 2007, and Fouque and Leurent in 2008, but the basic FSB idea appears to be secure, and the FSB submission remains unbroken. On the other hand, the FSB submission is also quite slow, and was not selected for the second round of the competition. This paper introduces RFSB, an enhancement to FSB. In particular, this paper introduces the RFSB-509 compression function, RFSB with a particular set of parameters. RFSB-509, like the FSB-256 compression function, is designed to be used inside a 256-bit collision-resistant hash function: all known attack strategies cost more than 2128 to find collisions in RFSB-509. However, RFSB-509 is an order of magnitude faster than FSB-256. On a single core of a Core 2 Quad CPU, RFSB-509 runs at 13.62 cycles/byte: faster than SHA-256, faster than 6 of the 14 secondround SHA-3 candidates, and faster than 2 of the 5 SHA-3 finalists.<br /> Keyword: Compression functions,Tight reduction to L1 cache,Linearization,Collision resistance,Generalized birthday attacks,Information-set decoding

AB - The FSB (fast syndrome-based) hash function was submitted to the SHA-3 competition by Augot, Finiasz, Gaborit, Manuel, and Sendrier in 2008, after preliminary designs proposed in 2003, 2005, and 2007. Many FSB parameter choices were broken by Coron and Joux in 2004, Saarinen in 2007, and Fouque and Leurent in 2008, but the basic FSB idea appears to be secure, and the FSB submission remains unbroken. On the other hand, the FSB submission is also quite slow, and was not selected for the second round of the competition. This paper introduces RFSB, an enhancement to FSB. In particular, this paper introduces the RFSB-509 compression function, RFSB with a particular set of parameters. RFSB-509, like the FSB-256 compression function, is designed to be used inside a 256-bit collision-resistant hash function: all known attack strategies cost more than 2128 to find collisions in RFSB-509. However, RFSB-509 is an order of magnitude faster than FSB-256. On a single core of a Core 2 Quad CPU, RFSB-509 runs at 13.62 cycles/byte: faster than SHA-256, faster than 6 of the 14 secondround SHA-3 candidates, and faster than 2 of the 5 SHA-3 finalists.<br /> Keyword: Compression functions,Tight reduction to L1 cache,Linearization,Collision resistance,Generalized birthday attacks,Information-set decoding

U2 - 10.1007/978-3-642-21969-6_9

DO - 10.1007/978-3-642-21969-6_9

SN - 978-3-642-21968-9

BT - Progress in Cryptology

T2 - Progress in Cryptology

A2 - Pointcheval,David

ED - Pointcheval,David

T3 - Lecture Notes in Computer Science

T3 - en_GB

SP - 134

EP - 152

ER -