Design of hashing algorithms
Author(s)
Bibliographic Information
Design of hashing algorithms
(Lecture notes in computer science, 756)
Springer-Verlag, c1993
- : gw
- : us
Available at / 50 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||75693059766
-
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:756931008050
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
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.
by "Nielsen BookData"