SHA-3 Finalist Grostl: Round 3 Public Comments

First Page		Document Content
Date: 2012-05-29 09:20:30 NIST hash function competition Hashing SHA-2 Preimage attack Grøstl Keccak Collision attack Collision resistance Advanced Encryption Standard Cryptography Error detection and correction Cryptographic hash functions		SHA-3 Finalist Grostl: Round 3 Public Comments Add to Reading List Source URL: csrc.nist.gov Download Document from Source Website File Size: 256,69 KB Share Document on Facebook

	MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1 DocID: 1xUN2 - View Document
	Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html \| pdf \| kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that DocID: 1xTR9 - View Document
	Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions DocID: 1xTdH - View Document