Provably Secure FFT Hashing

First Page		Document Content
Date: 2012-06-20 09:50:36 Collision resistance Mathematics Hash function SWIFFT Applied mathematics Fast Fourier transform Cyberwarfare Provably secure cryptographic hash function Cryptographic hash functions Cryptography Digital signal processing		Provably Secure FFT Hashing Add to Reading List Source URL: csrc.nist.gov Download Document from Source Website File Size: 765,97 KB Share Document on Facebook

	Lattice Cryptography: A White Paper Daniele Micciancio∗ March 16, 2010 1 DocID: 1pUoS - View Document
	Guidelines for managing the endangered Growling Grass Frog in urbanising landscapes Geoffrey Heard, Michael Scroggie and Nick Clemann 2010 DocID: 1lADF - View Document
	SWIFFT: A Modest Proposal for FFT Hashing Vadim Lyubashevsky1, Daniele Micciancio1 , Chris Peikert2, , and Alon Rosen3 1 University of California at San Diego DocID: 1lyrp - View Document
	Lattice-based Cryptography Daniele Micciancio∗ Oded Regev† July 22, 2008 DocID: 14vOf - View Document
	Preimage Attacks On Provably Secure FFT Hashing proposed at Second Hash Workshop in 2006 Donghoon Chang Center for Information Security Technologies(CIST), Korea University, Korea DocID: 12NLC - View Document