Design of Hashing Algorithms. 1st ed. 1993

種類:

電子ブック

責任表示:

by Josef Pieprzyk, Babak Sadeghiyan

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1993

著者名:

• Pieprzyk, Josef.
• Sadeghiyan, Babak.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 756

ISBN:

9783540481980 [3540481982]    

注記:

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.
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.

ローカル注記:

学内専用E-BOOKS (local access only)