Design of Hashing Algorithms (Lecture Notes in Computer Science) - Softcover
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.
"synopsis" may belong to another edition of this title.
- PublisherSpringer Verlag
- Publication date1994
- ISBN 10 0387575006
- ISBN 13 9780387575001
- BindingPaperback
- Number of pages194
(No Available Copies)
Search Books: Create a WantIf you know the book but cannot find it on AbeBooks, we can automatically search for it on your behalf as new inventory is added. If it is added to AbeBooks by one of our member booksellers, we will notify you!
Create a Want