SWIFFT: A Modest Proposal for FFT Hashing
- 18 July 2008
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functionscomputational complexity, 2007
- Generalized Compact Knapsacks Are Collision ResistantLecture Notes in Computer Science, 2006
- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum ProblemLecture Notes in Computer Science, 2005
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection FactorSIAM Journal on Computing, 2004
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003
- A Design Principle for Hash FunctionsPublished by Springer Science and Business Media LLC ,2001
- F.F.T. Hashing is not Collision-freePublished by Springer Science and Business Media LLC ,2001
- NTRU: A ring-based public key cryptosystemLecture Notes in Computer Science, 1998
- A practical attack against knapsack based hash functionsPublished by Springer Science and Business Media LLC ,1995
- How to construct random functionsJournal of the ACM, 1986