Design of Hashing Algorithms

Başlık:

ISBN:

9783540481980

Personal Author:

Pieprzyk, Josef. author.

Edition:

1st ed. 1993.

Yayın Bilgileri:

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

Fiziksel Tanımlama:

XV, 196 p. online resource.

Series:

Lecture Notes in Computer Science, 756

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.

Abstract:

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.

Subject Term:

Artificial intelligence -- Data processing.

Cryptography.

Data encryption (Computer science).

Coding theory.

Information theory.

Discrete mathematics.

Algorithms.

Operating systems (Computers).

Data Science.

Cryptology.

Coding and Information Theory.