Design of hashing algorithms
著者
書誌事項
Design of hashing algorithms
（Lecture notes in computer science, 756）
Springer-Verlag, c1993
- : gw
- : us
大学図書館所蔵 件 / 全50件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より
