|
|||||||||||||||||||||||||||||||||||
|
1 Review
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
Most Helpful First | Newest First
|
|
2 of 2 people found the following review helpful:
4.0 out of 5 stars
explains many hash algorithms,
By
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. |
|
Most Helpful First | Newest First
|
|
Design of Hashing Algorithms (Lecture Notes in Computer Science) by Josef Pieprzyk (Paperback - Jan. 1994)
Used & New from: $38.75
| |
| ||
