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-...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
756 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Design of hashing algorithms, Josef Pieprzyk, Babak Sadeghiyan, 1993, Berlin, Springer-Verlag, 1 vol. (XIII-194 p.), Lecture notes in computer science, 0-387-57500-6 • Design of Hashing Algorithms, Texte imprimé, 9783662197981 |
Obsah:
- 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.