Buch, Englisch, Band 756, 196 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 335 g
Buch, Englisch, Band 756, 196 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 335 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-57500-9
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Kryptologie, Informationssicherheit
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Informatik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
Weitere Infos & Material
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.
