Difference between revisions of "SWIFFT"

Latest revision as of 09:32, 2 December 2008

Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen - SWIFFT: A Modest Proposal for FFT Hashing

FSE 5086:54-72,2008

Author : Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen
Title : SWIFFT: A Modest Proposal for FFT Hashing
In : FSE -
Address :
Date : 2008

Johannes Buchmann, Richard Lindner - Secure Parameters for SWIFFT

,2008

Author : Johannes Buchmann, Richard Lindner
Title : Secure Parameters for SWIFFT
In : -
Address :
Date : 2008

@@ Line 51: / Line 51: @@
 === Others ===
+<bibtex>
+@misc{cryptoeprint:2008:493,
+    author = {Johannes Buchmann and Richard Lindner},
+    title = {Secure Parameters for SWIFFT},
+    howpublished = {Cryptology ePrint Archive, Report 2008/493},
+    year = {2008},
+    url= {http://eprint.iacr.org/2008/493},
+    abstract = {The SWIFFT compression functions, proposed by Lyubashevsky et al. at FSE 2008, are very efficient instantiations of generalized compact knapsacks. They have the unique property, that asymptotically fi�nding collisions for a random compression function implies being able to solve the worst case of computationally hard lattice problems. We present two results. First, we show that the scheme works equally efficient, when the main security parameter n is the predecessor of a prime instead of a power of two. Then, we present parameter generation algorithms for both cases. Second, we give experimental evidence that fi�nding pseudo-collisions for SWIFFT, is as hard as breaking a 87-bit symmetric cipher according to Lenstra's predictions. We then suggest conservative parameters, corresponding to 100-bit security.},
+}
+</bibtex>