Design of Hashing Algorithms

Josef Pieprzyk, Babak Sadeghiyan (Autoren)

Buch | Softcover

XV, 196 Seiten

1993 | 1993
Springer Berlin (Verlag)
978-3-540-57500-9 (ISBN)

Infos

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.

Inhalt

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.

Produkt-Details

• Erscheint lt. Verlag: 23.11.1993
• Reihe/Serie: Lecture Notes in Computer Science
• Zusatzinfo: XV, 196 p.
• Verlagsort: Berlin
• Sprache: englisch
• Maße: 216 x 279 mm
• Gewicht: 286 g
• Themenwelt: Mathematik / Informatik ► Informatik ► Datenbanken
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Schlagworte: Algorithm analysis and problem complexity • Algorithm design • algorithms • combinatorics • Cryptology • Database • data encryption • data structures • Datenverschlüsselungsstandards • DES • Digitale Signaturen • Digital Signatures • Hashing • Kryptographie / Kryptologie • Kryptologie • Pseudorandomness • Pseudo-Zufälligkeit • Standards
• ISBN-10: 3-540-57500-6 / 3540575006
• ISBN-13: 978-3-540-57500-9 / 9783540575009
• Zustand: Neuware