Design of Hashing Algorithms [electronic resource] / edited by Josef Pieprzyk, Babak Sadeghiyan.

By: Pieprzyk, Josef [editor.]Contributor(s): Sadeghiyan, Babak [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 756Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1993Description: XV, 196 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540481980Subject(s): Computer science | Computer Communication Networks | Operating systems (Computers) | Data encryption (Computer science) | Coding theory | Computer software | Combinatorics | Computer Science | Data Encryption | Coding and Information Theory | Combinatorics | Algorithm Analysis and Problem Complexity | Operating Systems | Computer Communication NetworksAdditional physical formats: Printed edition:: No titleDDC classification: 005.82 LOC classification: QA76.9.A25Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha