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.
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Coding theory.
موضوع مستند نشده
Data encryption (Computer science)
موضوع مستند نشده
Data structures (Computer scienc.
رده بندی کنگره
شماره رده
QA76
.
9
.
H36
نشانه اثر
E358
1993
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )