Design of Hashing Algorithms
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.
1101508922
Design of Hashing Algorithms
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.
54.99
In Stock
5
1
Design of Hashing Algorithms
196
Design of Hashing Algorithms
196Paperback(1993)
$54.99
54.99
In Stock
Product Details
| ISBN-13: | 9783540575009 |
|---|---|
| Publisher: | Springer Berlin Heidelberg |
| Publication date: | 01/07/1994 |
| Series: | Lecture Notes in Computer Science , #756 |
| Edition description: | 1993 |
| Pages: | 196 |
| Product dimensions: | 8.50(w) x 10.98(h) x 0.02(d) |
From the B&N Reads Blog