Metraipolis › archive › dc_307e67a556bb
SWIFFT — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/SWIFFT
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-05T23:36:36.613Z
- SHA-256 of the archived text
c0a99ad2ae3bee6babee422d6cc8d43b756e4f88bc702343659b67ce383111ab- Stable URL of this page
https://metraipolis.com/documento/dc_307e67a556bb
How to cite
SWIFFT — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/SWIFFT (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_307e67a556bb (Metraipolis archive dc_307e67a556bb, sha256 c0a99ad2ae3bee6babee422d6cc8d43b756e4f88bc702343659b67ce383111ab)
BibTeX
@misc{dc307e67a556bb,
title = {SWIFFT — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/SWIFFT},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_307e67a556bb; sha256 c0a99ad2ae3bee6babee422d6cc8d43b756e4f88bc702343659b67ce383111ab},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/SWIFFT. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In cryptography, SWIFFT is a collection of provably secure hash functions. It is based on the concept of the fast Fourier transform (FFT). SWIFFT is not the first hash function based on the FFT, but it sets itself apart by providing a mathematical proof of its security. It can be shown that finding collisions in SWIFFT is at least as difficult as finding short vectors in cyclic/ideal lattices in the worst case. By giving a security reduction to the worst case of a difficult mathematical problem, SWIFFT gives a much stronger security guarantee than most other cryptographic hash functions. Unlike many other provably secure hash functions, the algorithm is quite fast, yielding a throughput of 40 Mbit/s on a 3.2 GHz Intel Pentium 4. Although SWIFFT satisfies many desirable cryptographic and statistical properties, it was not designed to be an "all-purpose" cryptographic hash function. For example, it is not a pseudorandom function, and would not be a suitable instantiation of a random oracle. The algorithm is less efficient than most traditional hash functions that do not give a proof of their collision-resistance. Therefore, its practical use would lie mostly in applications where the proof of collision-resistance is particularly valuable, such as digital signatures that must remain trustworthy for a long time. A modification of SWIFFT called SWIFFTX was proposed as a candidate for SHA-3 function to the NIST hash function competition and was rejected in the first round. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «cryptographic hash function»). Fonte: Wikipedia in inglese, voce «SWIFFT» — https://en.wikipedia.org/wiki/SWIFFT Wikidata Q7395188: «cryptographic hash function» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7395188 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/SWIFFT?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 1341999296, consultata il 2026-10-05T23:12:53.697Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b03f02ee47b021870f5d98a0134e6c7e9f5ff7d3033827e8a5855cac976b4810