Advertisement

About this book

Introduction

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.

Keywords

Cryptology DES Data Encryption Datenverschlüsselungsstandards Digital Signatures Hashing Pseudo-Zufälligkeit Pseudorandomness Standards algorithm design algorithms database

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-57500-6
  • Copyright Information Springer-Verlag Berlin Heidelberg 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-57500-9
  • Online ISBN 978-3-540-48198-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site