parSkein-tm-final_eprint.dvi

First Page		Document Content
Date: 2010-10-02 04:40:32 Hashing Computing NIST hash function competition Skein Threefish Hash tree Hash function B-tree SHA-2 Error detection and correction Cryptography Cryptographic hash functions		parSkein-tm-final_eprint.dvi Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 185,47 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