Design of hashing algorithms /
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-...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer-Verlag,
©1993.
|
| Series: | Lecture notes in computer science ;
756. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | 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. |
|---|---|
| Item Description: | Electronic resource. |
| Physical Description: | 1 online resource (xiii, 194 pages) : illustrations. |
| Format: | Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |
| Bibliography: | Includes bibliographical references (pages 179-190) and index. |
| ISBN: | 9783540481980 (electronic bk.) 3540481982 (electronic bk.) |
| ISSN: | 0302-9743 ; |