Hash Function Tutorial Introduction
A hash function (in the unrestricted sense) is a function h which has, as a minmum, the following two properties:
compression -h maps an input x of arbitrary finite bitlength, to an output h(x) of fixed bitlength n.
ease of computation – given h and an input x, h(x) is easy to compute.
Relationships between properties h Collision resistance implies 2nd-preimage resistance of hash functions Justification: Suppose h has collision resistance. Fix an input xj . If h does not have 2nd-preimage resistance, then it is feasible to find a distinct input xi such that h(xi) = h(xj), in which case (xi, xj) is a pair of distinct inputs hashing to the same output, contradiction collision resistance.
Website: www.uow.edu.au | Filesize: 3365kb
No of Page(s): 40
Click here to download Hash Function Tutorial.
Related Copyrighted Books
Fast Software Encryption: 8th International Workshop, FSE 2001 Yokohama, Japan, April 2-4, 2001, Revised Papers (Lecture Notes in Computer Science)
Fast Software Encryption: 12th International Workshop, FSE 2005, Paris, France, February 21-23, 2005, Revised Selected Papers (Lecture Notes in Computer Science / Security and Cryptology)
Provable Security: Third International Conference, ProvSec 2009, Guangzhou, China, November 11-13, 2009. Proceedings (Lecture Notes in Computer Science / Security and Cryptology)
Fast Software Encryption: 7th International Workshop, FSE 2000, New York, NY, USA, April 10-12, 2000. Proceedings (Lecture Notes in Computer Science)
Advances in Cryptology – EUROCRYPT 2007: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, … Computer Science / Security and Cryptology)
Security and Privacy in Communication Networks: 5th International ICST Conference, SecureComm 2009, Athens, Greece, September 14-18, 2009, Revised Selected … and Telecommunications Engineering)