Matches in DBpedia 2014 for { <http://dbpedia.org/resource/SWIFFT> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- SWIFFT abstract "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 FFT, but it sets itself apart by providing a mathematical proof of its security. It also uses the LLL basis reduction algorithm. It can be shown that finding collisions in SWIFFT is as least as difficult as finding short vectors in cyclic/ideal lattices in the worst case. By giving a security reduction to the worst case scenario 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 40MB/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.".
- SWIFFT wikiPageExternalLink SWIFFT.
- SWIFFT wikiPageExternalLink swifft.pdf.
- SWIFFT wikiPageID "25702256".
- SWIFFT wikiPageRevisionID "591847638".
- SWIFFT designers "Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen".
- SWIFFT hasPhotoCollection SWIFFT.
- SWIFFT name "SWIFFT".
- SWIFFT publishDate "2008".
- SWIFFT relatedTo "FFT-based algorithms".
- SWIFFT subject Category:Cryptographic_hash_functions.
- SWIFFT type Abstraction100002137.
- SWIFFT type CryptographicHashFunctions.
- SWIFFT type Function113783816.
- SWIFFT type MathematicalRelation113783581.
- SWIFFT type Relation100031921.
- SWIFFT comment "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 FFT, but it sets itself apart by providing a mathematical proof of its security. It also uses the LLL basis reduction algorithm. It can be shown that finding collisions in SWIFFT is as least as difficult as finding short vectors in cyclic/ideal lattices in the worst case.".
- SWIFFT label "SWIFFT".
- SWIFFT sameAs m.09v5clm.
- SWIFFT sameAs Q7395188.
- SWIFFT sameAs Q7395188.
- SWIFFT sameAs SWIFFT.
- SWIFFT wasDerivedFrom SWIFFT?oldid=591847638.
- SWIFFT isPrimaryTopicOf SWIFFT.