Everything about SWIFFT
Cryptographic hash function
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. Wikipedia →
đź§ Start here: a 6-step reading path
- Read the overview: SWIFFTA 5-minute orientation
- Pick up a classic book: Des Herrn Swifft Grand misteré oder das grosse Geheimniss und die Kunst=Betrachtungen über dem Abtritt anzustellen ...The most-reprinted book on the subject
- Read the landmark paper: Surgery versus cast immobilisation for adults with a bicortical fracture of the scaphoid waist (SWIFFT): a pragmatic, multicentre, open-label, randomised superiority trialCited 112 times
- Go sideways: Security of cryptographic hash functionsA closely related topic
- Go sideways: Ideal latticeA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Surgery versus cast immobilisation for adults with a bicortical fracture of the scaphoid waist (SWIFFT): a pragmatic, multicentre, open-label, randomised superiority trial
Scaphoid Waist Internal Fixation for Fractures Trial (SWIFFT) protocol: a pragmatic multi-centre randomised controlled trial of cast treatment versus surgical fixation for the treatment of bi-cortical, minimally displaced fractures of the scaphoid waist in adults
Surgical fixation compared with cast immobilisation for adults with a bicortical fracture of the scaphoid waist: the SWIFFT RCT
LibSWIFFT - A fast C/C++ Library for the SWIFFT Secure Homomorphic Hash Function
Surgical Fixation Versus Cast Immobilization for Adults With Bicortical Scaphoid Fractures: A Target Trial Emulation of the SWIFFT Trial
📚 Books worth reading
- 📕Des Herrn Swifft Grand misteré oder das grosse Geheimniss und die Kunst=Betrachtungen über dem Abtritt anzustellen ...Jonathan Swift, Edward Ward · 1748
- 📕Capitain Samuel Brunts Reise nach Cacklogallinien und weiter in der Mond, nebst dem Leben Harvays, des weltbekannten Zauberers in Dublin, und einigen andern moralischen und satyrischen Schrifften Herrn D. SwifftsJonathan Swift · 1751
- 📕Capitain Samuel Brunts Reise nach Cacklogallinien und weiter in der Mond, nebst dem Leben Harvays, des weltbekannten Zauberers in Dublin, und einigen andern moralischen und satyrischen Schrifften Herrn D. Swiffts · 1969
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Security of cryptographic hash functions In cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based…
- Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
- Short integer solution problem Short integer solution (SIS) and ring-SIS problems are two average-case problems that are used in lattice-based cryptography constructions. Lattice-based…
- One-way function Unsolved problem in computer science Do one-way functions exist? More unsolved problems in computer science In computer science, a one-way function is…
- Discrete Fourier transform In mathematics, the discrete Fourier transform (DFT) is a discrete version of the Fourier transform that converts a finite sequence of numbers into another…
- Pseudorandom function family In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle in…
- Collision resistance In cryptography, collision resistance is a property of cryptographic hash functions (CHFs): a hash function H is collision-resistant if it is hard to find…
- Falcon (signature scheme) Falcon is a post-quantum signature scheme. It was designed by Thomas Prest, Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky,…