ENGLISH

Design of Hashing Algorithms

By Josef Pieprzyk , Babak Sadeghiyan (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1993
ISBN
978-3-540-57500-9, 978-3-540-48198-0
DOI
10.1007/3-540-57500-6
Language
english
Format
PDF
Filesize
3 MB (2689103 bytes)
Series
Lecture Notes in Computer Science 756
Edition
1
Pages
196\208
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Data Encryption; Coding and Information Theory; Co

Description

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.

Similar books