Have one to sell? Sell yours here
Design of Hashing Algorithms (Lecture Notes in Computer Science)
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

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

Josef Pieprzyk (Author), Pieprzyk (Author)
4.0 out of 5 stars  See all reviews (1 customer review)


Available from these sellers.


Textbook Student FREE Two-Day Shipping for Students. Learn more

Formats

Amazon Price New from Used from
Paperback $40.42  
Paperback, January 1994 --  

Book Description

Lecture Notes in Computer Science January 1994
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 example 20 Mbytes. Hashing algorithms were first used for searching records in databases; they are central for digital signature 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.

Customers Who Viewed This Item Also Viewed


Product Details

  • Paperback: 194 pages
  • Publisher: Springer-Verlag (January 1994)
  • Language: English
  • ISBN-10: 0387575006
  • ISBN-13: 978-0387575001
  • Product Dimensions: 9 x 5.9 x 0.6 inches
  • Shipping Weight: 4 ounces
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #7,864,925 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

1 Review
5 star:    (0)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

2 of 2 people found the following review helpful:
4.0 out of 5 stars explains many hash algorithms, January 7, 2005
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.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
Browse and search another edition of this book.
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:

Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject