Skip to search formSkip to main contentSkip to account menu

SWIFFT

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
BKZ and its variants are considered as the most efficient lattice reduction algorithms compensating both the quality and runtime… 
2014
2014
We investigate the current state-of-art performance of lattice reduction algorithms. We perform experiments to examine the limit… 
2011
2011
Erklärung Hiermit versichere ich, dass der Inhalt dieser Diplomarbeit Ergebnis mei-ner Arbeit ist und alle verwendeten Quellen… 
2011
2011
One essential quest in cryptography is the search for hard instances of a given computational problem that is known to be hard in… 
2010
2010
In this paper, we study the complexity of solving hard knapsack problems, especially knapsacks with a density close to 1 where… 
2010
2010
A mix of enthusiasm, commitment and technology has helped create a network of individuals and organisations in south-west… 
2009
2009
The SWIFFT compression functions, proposed by Lyubashevsky et al. at FSE 2008, are very efficient instantiations of generalized… 
Review
1996
Review
1996
This paper discusses the architectures of the TM-66 swiFFT DSP chip, the algorithms that the swiFFT chip is optimized for, the…