Design of Hashing Algorithms

566 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utforska kategorier

Innehållsförteckning

Hoppa över listan

Mer från samma författare

Hoppa över listan

Mer från samma serie

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad
Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

922 kr

Federico Bolelli, Achraf Ben-Hamadou, Yaqi Wang, Luca Lumetti, Sergi Pujades, Shuai Wang, Kevin Marchesini, Costantino Grana - Oral and Dental Image Analysis, Häftad
  • Nyhet
Del 16473

Oral and Dental Image Analysis

Federico Bolelli, Achraf Ben-Hamadou, Yaqi Wang, Luca Lumetti, Sergi Pujades, Shuai Wang, Kevin Marchesini, Costantino Grana

Häftad, 2026

833 kr

Michael Beigl, Henning Christiansen, Thomas R. Roth-Berghofer, Anders Kofod-Petersen, Kenny R. Coventry, Hedda R. Schmidtke - Modeling and Using Context, Häftad

Modeling and Using Context

Michael Beigl, Henning Christiansen, Thomas R. Roth-Berghofer, Anders Kofod-Petersen, Kenny R. Coventry, Hedda R. Schmidtke

Häftad, 2011

550 kr

Hoppa över listan

Du kanske också är intresserad av