Design of Hashing Algorithms

Josef Pieprzyk, Babak Sadeghiyan (eds.)3540575006, 9783540575009, 0387575006

This work presents recent developments in hashing algorithm design. Hashing is the process of creating a short digest (i.e., 64 bits) for a message of arbitrary length, for exam- ple 20 Mbytes. Hashing algorithms were first used for sear- ching records in databases; they are central for digital si- gnature applications and are used for authentication without secrecy. Covering all practical and theoretical issues related to the design of secure hashing algorithms the book is self contained; it includes an extensive bibliography on the topic.

---

Table of contents :
Introduction….Pages 1-17
Overview of hash functions….Pages 18-47
Methods of attack on hash functions….Pages 48-55
Pseudorandomness….Pages 56-76
Construction of super-pseudorandom permutations….Pages 77-104
A sound structure….Pages 105-131
A construction for one way hash functions and pseudorandom bit generators….Pages 132-156
How to construct a family of strong one-way permutations….Pages 157-169
Conclusions….Pages 170-178