Editore: Springer Berlin Heidelberg, 1993
ISBN 10: 3540575006 ISBN 13: 9783540575009
Lingua: Inglese
Da: Buchpark, Trebbin, Germania
EUR 39,60
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloCondizione: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,16
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 53,60
Convertire valutaQuantità: 15 disponibili
Aggiungi al carrelloCondizione: New.
EUR 61,22
Convertire valutaQuantità: 15 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Chiron Media, Wallingford, Regno Unito
EUR 56,59
Convertire valutaQuantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 52,45
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1993
ISBN 10: 3540575006 ISBN 13: 9783540575009
Lingua: Inglese
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
EUR 55,93
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: new. Paperback. 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. 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. Covering all practical and theoretical issuesrelated to the design of secure hashing algorithms the bookis self contained; Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 1993
ISBN 10: 3540575006 ISBN 13: 9783540575009
Lingua: Inglese
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 112,32
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: new. Paperback. 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. 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. Covering all practical and theoretical issuesrelated to the design of secure hashing algorithms the bookis self contained; Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Da: BennettBooksLtd, San Diego, NV, U.S.A.
EUR 141,06
Convertire valutaQuantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: New. In shrink wrap. Looks like an interesting title!
Editore: Springer Berlin Heidelberg, 1993
ISBN 10: 3540575006 ISBN 13: 9783540575009
Lingua: Inglese
Da: moluna, Greven, Germania
EUR 48,37
Convertire valutaQuantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 d.