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.

Bibliographic Information

Book Title: Design of Hashing Algorithms
Editors: Josef Pieprzyk, Babak Sadeghiyan
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-57500-6
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1993
Softcover ISBN: 978-3-540-57500-9Published: 23 November 1993
eBook ISBN: 978-3-540-48198-0Published: 30 June 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XV, 196
Topics: Data Structures, Cryptology, Coding and Information Theory, Combinatorics, Algorithm Analysis and Problem Complexity, Operating Systems

Publish with us

Policies and ethics

Design of Hashing Algorithms

Overview

Access this book

Other ways to access

Table of contents (9 chapters)

Front Matter

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation