Design of Hashing Algorithms (Lecture Notes in Computer Science) (Paperback)

~ (Author), Babak Sadeghiyan (Author)

Editorial Reviews

Product 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.

Product Details

• Paperback: 194 pages
• Publisher: Springer; 1 edition (January 7, 1994)
• Language: English
• ISBN-10: 3540575006
• ISBN-13: 978-3540575009
• Product Dimensions: 9.2 x 6.1 x 0.5 inches
• Shipping Weight: 11.2 ounces (View shipping rates and policies)
• Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
• Amazon.com Sales Rank: #1,462,751 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

1 of 1 people found the following review helpful:

4.0 out of 5 stars explains many hash algorithms, January 7, 2005

By	W Boudville (Terra, Sol 3) - See all my reviews (TOP 10 REVIEWER)    (REAL NAME)

This review is from: Design of Hashing Algorithms (Lecture Notes in Computer Science) (Paperback)

Hashing is vital in many computational applications. It forms the backbone of searching, for example. So this book is very useful in giving a detailed explanation of the theory behind various hashing methods.

It is slightly dated. It does not describe the Simple Hashing Algorithmn 2, which is currently considered the most secure method. But the ideas in the book are still applicable. Useful if you want a rigorous understanding of the theoretical underpinnings of the field. Or if you want to start designing your own hash algorithm.