SWIFFT: A Modest Proposal for FFT Hashing
SWIFFT: A Modest Proposal for FFT Hashing
Vadim Lyubashevsky,Daniele Micciancio,Chris Peikert,Alon Rosen
2008 · DOI: 10.1007/978-3-540-71039-4_4
Fast Software Encryption Workshop · 303 Citations
TLDR
It can be formally proved that finding a collision in a randomly-chosen function from the family is at least as hard as finding short vectors in cyclic/ideal lattices in the worst case.