Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/SWIFFT> ?p ?o }
Showing triples 1 to 60 of
60
with 100 triples 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 wikiPageLength "12620".
- SWIFFT wikiPageOutDegree "37".
- SWIFFT wikiPageRevisionID "646592196".
- SWIFFT wikiPageWikiLink Category:Cryptographic_hash_functions.
- SWIFFT wikiPageWikiLink Confusion_and_diffusion.
- SWIFFT wikiPageWikiLink Convolution.
- SWIFFT wikiPageWikiLink Convolution_theorem.
- SWIFFT wikiPageWikiLink Cryptographic_hash_function.
- SWIFFT wikiPageWikiLink Cryptography.
- SWIFFT wikiPageWikiLink Discrete_Fourier_transform_(general).
- SWIFFT wikiPageWikiLink Fast_Fourier_Transform.
- SWIFFT wikiPageWikiLink Fast_Fourier_transform.
- SWIFFT wikiPageWikiLink Fast_fourier_transform.
- SWIFFT wikiPageWikiLink Finite_field.
- SWIFFT wikiPageWikiLink Fourier_coefficients.
- SWIFFT wikiPageWikiLink Fourier_series.
- SWIFFT wikiPageWikiLink Fourier_transform.
- SWIFFT wikiPageWikiLink Ideal_lattice_cryptography.
- SWIFFT wikiPageWikiLink Lenstra-Lenstra-Lovász_lattice_basis_reduction_algorithm.
- SWIFFT wikiPageWikiLink Lenstra–Lenstra–Lovász_lattice_basis_reduction_algorithm.
- SWIFFT wikiPageWikiLink Linear_combination.
- SWIFFT wikiPageWikiLink NIST_hash_function_competition.
- SWIFFT wikiPageWikiLink Number-theoretic_transform.
- SWIFFT wikiPageWikiLink Polynomial.
- SWIFFT wikiPageWikiLink Polynomial-time_reduction.
- SWIFFT wikiPageWikiLink Polynomial_ring.
- SWIFFT wikiPageWikiLink Prime.
- SWIFFT wikiPageWikiLink Prime_number.
- SWIFFT wikiPageWikiLink Provably_secure_cryptographic_hash_function.
- SWIFFT wikiPageWikiLink Pseudorandom_function.
- SWIFFT wikiPageWikiLink Pseudorandom_function_family.
- SWIFFT wikiPageWikiLink Random_oracle.
- SWIFFT wikiPageWikiLink Randomness_extractor.
- SWIFFT wikiPageWikiLink SWIFFTX.
- SWIFFT wikiPageWikiLink Security_of_cryptographic_hash_functions.
- SWIFFT wikiPageWikiLink Universal_hashing.
- SWIFFT wikiPageWikiLink Worst-case_complexity.
- SWIFFT wikiPageWikiLinkText "SWIFFT".
- 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 wikiPageUsesTemplate Template:Infobox_cryptographic_hash_function.
- SWIFFT subject Category:Cryptographic_hash_functions.
- SWIFFT hypernym Collection.
- SWIFFT type Book.
- SWIFFT type Algorithm.
- SWIFFT type Function.
- 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 wasDerivedFrom SWIFFT?oldid=646592196.
- SWIFFT isPrimaryTopicOf SWIFFT.