Design of Hashing Algorithms / Edition 1

by Josef Pieprzyk, Babak Sadeghiyan

Overview

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.

Product Details

ISBN-13:	9783540575009
Publisher:	Springer Berlin Heidelberg
Publication date:	01/07/1994
Series:	Lecture Notes in Computer Science , #756
Edition description:	1993
Pages:	196
Product dimensions:	8.50(w) x 10.98(h) x 0.02(d)

Table of Contents

Overview of hash functions.- Methods of attack on hash functions.- Pseudorandomness.- Construction of super-pseudorandom permutations.- A sound structure.- A construction for one way hash functions and pseudorandom bit generators.- How to construct a family of strong one-way permutations.- Conclusions.