Metraipolis › archive › dc_4b32b7cdac3c
Fast syndrome-based hash — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Fast_syndrome-based_hash
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-05T22:55:57.907Z
- SHA-256 of the archived text
50a37dd5f9c7a03ce99fd269f8a38ab3bd19763a6d4a12afd85eb2b771f2c33c- Stable URL of this page
https://metraipolis.com/documento/dc_4b32b7cdac3c
How to cite
Fast syndrome-based hash — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Fast_syndrome-based_hash (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_4b32b7cdac3c (Metraipolis archive dc_4b32b7cdac3c, sha256 50a37dd5f9c7a03ce99fd269f8a38ab3bd19763a6d4a12afd85eb2b771f2c33c)
BibTeX
@misc{dc4b32b7cdac3c,
title = {Fast syndrome-based hash — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Fast_syndrome-based_hash},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_4b32b7cdac3c; sha256 50a37dd5f9c7a03ce99fd269f8a38ab3bd19763a6d4a12afd85eb2b771f2c33c},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Fast_syndrome-based_hash. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In cryptography, the fast syndrome-based hash functions (FSB) are a family of cryptographic hash functions introduced in 2003 by Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier. Unlike most other cryptographic hash functions in use today, FSB can to a certain extent be proven to be secure. More exactly, it can be proven that breaking FSB is at least as difficult as solving a certain NP-complete problem known as regular syndrome decoding so FSB is provably secure. Though it is not known whether NP-complete problems are solvable in polynomial time, it is often assumed that they are not. Several versions of FSB have been proposed, the latest of which was submitted to the SHA-3 cryptography competition but was rejected in the first round. Though all versions of FSB claim provable security, some preliminary versions were eventually broken. The design of the latest version of FSB has however taken this attack into account and remains secure to all currently known attacks. As usual, provable security comes at a cost. FSB is slower than traditional hash functions and uses quite a lot of memory, which makes it impractical on memory constrained environments. Furthermore, the compression function used in FSB needs a large output size to guarantee security. This last problem has been solved in recent versions by simply compressing the output by another compression function called Whirlpool. However, though the authors argue that adding this last compression does not reduce security, it makes a formal security proof impossible. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; categoria «Cryptographic hash functions»). Fonte: Wikipedia in inglese, voce «Fast syndrome-based hash» — https://en.wikipedia.org/wiki/Fast_syndrome-based_hash Wikidata Q5436992 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5436992 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Fast_syndrome-based_hash?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1294704855, consultata il 2026-10-05T22:47:19.121Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 8084a2335108c0e087a52a2f1ecbe7c1a6f444c45ac1c519fbb73bf69ac6bedb