Some Plausible Constructions of Double-Block-Length Hash Functions Shoichi Hirose

First Page		Document Content
Date: 2008-06-01 18:17:49 Hashing One-way compression function Hash function Collision resistance MDC-2 Birthday attack Preimage attack Block cipher Collision attack Cryptographic hash functions Cryptography Search algorithms		Some Plausible Constructions of Double-Block-Length Hash Functions Shoichi Hirose Add to Reading List Source URL: www.iacr.org Download Document from Source Website File Size: 191,74 KB Share Document on Facebook

	An earlier version of this paper appeared in EurocryptSecurity/Eﬃciency Tradeoﬀs for Permutation-Based Hashing Phillip Rogaway1 and John Steinberger2 1 DocID: 1q3qz - View Document
	Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers Phillip Rogaway1 and John Steinberger2 1 2 DocID: 1pg47 - View Document
	Hash Function Requirements for Schnorr Signatures Gregory Neven1,2 , Nigel P. Smart3 , and Bogdan Warinschi3 1 IBM Research – Zurich, Switzerland DocID: 19LBC - View Document
	Chapter 6 Hash Functions A hash function usually means a function that compresses, meaning the output is shorter than the input. Often, such a function takes an input of arbitrary or almost arbitrary length to one whose DocID: 12CPb - View Document