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

	Improving Local Collisions: New Attacks on Reduced SHA-256? Florian Mendel, Tomislav Nad, Martin Schl¨affer IAIK, Graz University of Technology, Austria DocID: 17M7r - 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
	Time-memory Trade-oﬀs for Near-collisions Gaëtan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to ﬁnd near-collisions for a hash DocID: 12HMr - View Document
	An abridged version of this paper appears in Advances in Cryptology { Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997. A New Paradigm for Collision-free Hashing: DocID: 12CJD - View Document
	Provably Secure MACs from Differentially-uniform Permutations and AES-based Implementations Kazuhiko Minematsu and Yukiyasu Tsunoo NEC Corporation DocID: QC4t - View Document