Cantitate/Preț
Produs

Design of Hashing Algorithms: Lecture Notes in Computer Science, cartea 756

Autor Josef Pieprzyk, Babak Sadeghiyan
en Limba Engleză Paperback – 23 noi 1993
This work presents recent developments in hashing algorithmdesign. 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 withoutsecrecy. Covering all practical and theoretical issuesrelated to the design of secure hashing algorithms the bookis self contained; it includes an extensive bibliography onthe topic.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31625 lei

Preț vechi: 39531 lei
-20% Nou

Puncte Express: 474

Preț estimativ în valută:
6053 6385$ 5044£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540575009
ISBN-10: 3540575006
Pagini: 216
Ilustrații: XV, 196 p.
Dimensiuni: 216 x 279 x 11 mm
Greutate: 0.31 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.