---

＜電子ブック＞
Design of Hashing Algorithms / by Josef Pieprzyk, Babak Sadeghiyan
(Lecture Notes in Computer Science. ISSN:16113349 ; 756)

版	1st ed. 1993.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1993
本文言語	英語
大きさ	XV, 196 p : online resource
著者標目	*Pieprzyk, Josef author Sadeghiyan, Babak author SpringerLink (Online service)
件　名	LCSH:Artificial intelligence -- Data processing  全ての件名で検索 LCSH:Cryptography LCSH:Data encryption (Computer science) LCSH:Coding theory LCSH:Information theory LCSH:Discrete mathematics LCSH:Algorithms LCSH:Operating systems (Computers) FREE:Data Science FREE:Cryptology FREE:Coding and Information Theory FREE:Discrete Mathematics FREE:Algorithms FREE:Operating Systems
一般注記	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 HTTP:URL=https://doi.org/10.1007/3-540-57500-6

 類似資料