Hash Function Requirements for Schnorr Signatures Gregory Neven1,2 , Nigel P. Smart3 , and Bogdan Warinschi3 1 IBM Research – Zurich, Switzerland - James Morehead - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2012-04-18 06:08:49 Forking lemma Random oracle Preimage attack Digital signature Collision resistance Elliptic Curve DSA Standard model MD5 Birthday attack Cryptography Cryptographic hash functions Schnorr signature		Hash Function Requirements for Schnorr Signatures Gregory Neven1,2 , Nigel P. Smart3 , and Bogdan Warinschi3 1 IBM Research – Zurich, Switzerland Add to Reading List Source URL: www.neven.org Download Document from Source Website File Size: 371,71 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