Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,754 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Confusion and diffusion
Convolution
Cryptographic hash function
Cryptography
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Analyzing Progressive-BKZ Lattice Reduction Algorithm
M. Haque
,
Mohammad Obaidur Rahman
International Journal of Computer Network and…
2019
Corpus ID: 86840376
BKZ and its variants are considered as the most efficient lattice reduction algorithms compensating both the quality and runtime…
Expand
2015
2015
Arithmetic in a Prime Field of SWIFFT/SWIFFTX
Kuwakado Hidenori
2015
Corpus ID: 125491856
2015
2015
Arithmetic in a Prime Field of SWIFFT/SWIFFTX (ワイドバンドシステム)
桑門 秀典
2015
Corpus ID: 116938676
2014
2014
Evaluating the performance of the practical lattice reduction algorithms
M. Haque
,
J. Pieprzyk
8th International Conference on Electrical and…
2014
Corpus ID: 15038475
We investigate the current state-of-art performance of lattice reduction algorithms. We perform experiments to examine the limit…
Expand
2011
2011
SWIFFT-Modifikationen, Korrektur von Operm5
Stephan Mönkehues
2011
Corpus ID: 127963935
Erklärung Hiermit versichere ich, dass der Inhalt dieser Diplomarbeit Ergebnis mei-ner Arbeit ist und alle verwendeten Quellen…
Expand
2011
2011
Towards efficient lattice-based cryptography
Richard Lindner
2011
Corpus ID: 17070916
One essential quest in cryptography is the search for hard instances of a given computational problem that is known to be hard in…
Expand
2010
2010
A new generic algorithm for hard knapsacks ( preprint )
Nick Howgrave-Graham
,
A. Joux
2010
Corpus ID: 14109944
In this paper, we study the complexity of solving hard knapsack problems, especially knapsacks with a density close to 1 where…
Expand
2010
2010
SWIFFT Help for Flora and Fauna
Andrew Arnold
2010
Corpus ID: 131730084
A mix of enthusiasm, commitment and technology has helped create a network of individuals and organisations in south-west…
Expand
2009
2009
Secure Parameters for SWIFFT
J. Buchmann
,
Richard Lindner
International Conference on Cryptology in India
2009
Corpus ID: 39747314
The SWIFFT compression functions, proposed by Lyubashevsky et al. at FSE 2008, are very efficient instantiations of generalized…
Expand
Review
1996
Review
1996
TM-66 swiFFT DSP chip: architecture, algorithms, and applications
J. Marsh
,
J. McCaskill
Defense, Security, and Sensing
1996
Corpus ID: 58027277
This paper discusses the architectures of the TM-66 swiFFT DSP chip, the algorithms that the swiFFT chip is optimized for, the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE