SWIFFT: A Modest Proposal for FFT Hashing Vadim Lyubashevsky1 , Daniele Micciancio1 , Chris Peikert2, , and Alon Rosen3 1

First Page		Document Content
Date: 2009-08-17 12:04:34 Mathematical analysis SWIFFT Fast Fourier transform Universal hashing Fourier transform SHA-2 Vector space Random oracle Hash function Cryptographic hash functions Mathematics Algebra		SWIFFT: A Modest Proposal for FFT Hashing Vadim Lyubashevsky1 , Daniele Micciancio1 , Chris Peikert2, , and Alon Rosen3 1 Add to Reading List Source URL: www.cc.gatech.edu Download Document from Source Website File Size: 205,62 KB Share Document on Facebook

	Time-memory Trade-offs for Near-collisions Ga¨etan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider o DocID: 1xTVd - View Document
	The Usage of Counter Revisited: Second-Preimage Attack on New Russian Standardized Hash Function Jian Guo1 , J´er´emy Jean1 , Ga¨etan Leurent2 , Thomas Peyrin1 , and Lei Wang1 1 DocID: 1xT7a - View Document
	The Skein Hash Function Family Version 1.3 — 1 Oct 2010 Niels Ferguson Stefan Lucks Bruce Schneier DocID: 1tn3m - View Document
	On the design and cryptanalysis of a one-way hash Carl Ellison Victor Miller Eran Tromer Rebecca Wright In this paper we describe a novel one-way hash function that is compliant with the NIST hash function competition dr DocID: 1t9VA - View Document
	Appears in Fast Software Encryption(FSE 2004), Lecture Notes in Computer Science, Vol. ????, Springer-Verlag. This is the full version. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for P DocID: 1rEjw - View Document