Josef Pieprzyk, Babak Sadeghiyan

Design of Hashing Algorithms

• Broschiertes Buch

Produktbeschreibung

This work presents recent developments in hashing algorithmdesign. 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 withoutsecrecy. Covering all practical and theoretical issuesrelated to the design of secure hashing algorithms the bookis self contained; it includes an extensive bibliography onthe topic.

Produktdetails

• Lecture Notes in Computer Science 756
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-57500-9
• 1993.
• Seitenzahl: 216
• Erscheinungstermin: 23. November 1993
• Englisch
• Abmessung: 235mm x 155mm x 12mm
• Gewicht: 340g
• ISBN-13: 9783540575009
• ISBN-10: 3540575006
• Artikelnr.: 23148336

Inhaltsangabe

Overview of hash functions.- Methods of attack on hash functions.- Pseudorandomness.- Construction of super-pseudorandom permutations.- A sound structure.- A construction for one way hash functions and pseudorandom bit generators.- How to construct a family of strong one-way permutations.- Conclusions.