Condizione: As New. Unread book in perfect condition.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 76,58
Quantità: 13 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New.
Da: Majestic Books, Hounslow, Regno Unito
EUR 88,73
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 256.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 85,69
Quantità: 1 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 85,63
Quantità: 13 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Condizione: New. pp. 256.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 99,16
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 100,01
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New. pp. 256.
Da: Revaluation Books, Exeter, Regno Unito
EUR 125,50
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 256 pages. 9.21x6.14x0.55 inches. In Stock.
Da: Buchpark, Trebbin, Germania
EUR 45,59
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Hervorragend. Zustand: Hervorragend | Seiten: 256 | Sprache: Englisch | Produktart: Bücher | A comprehensive and self-contained treatment of the subject, Authentication Codes and Combinatorial Designs covers optimal authentication codes, unconditionally secure authentication schemes, and both symmetric and asymmetric authentication codes. The book addresses an important area in cryptography, namely the authentication of codes. It ties together the notion of authentication codes and combinatorial designs and demonstrates how ideas from combinatorics can be used for cryptographic applications. The author proves the information-theoretic and combinatorial bounds and the conditions for achieving these bounds in simple, clean, and comprehensive language of mathematics.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 145,67
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 76,59
Quantità: 5 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Da: PBShop.store US, Wood Dale, IL, U.S.A.
EUR 104,11
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 100,66
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: moluna, Greven, Germania
EUR 74,28
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Pei, DingyiResearchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and ori.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 124,17
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - A comprehensive and self-contained treatment of the subject, Authentication Codes and Combinatorial Designs covers optimal authentication codes, unconditionally secure authentication schemes, and both symmetric and asymmetric authentication codes. The book addresses an important area in cryptography, namely the authentication of codes. It ties together the notion of authentication codes and combinatorial designs and demonstrates how ideas from combinatorics can be used for cryptographic applications. The author proves the information-theoretic and combinatorial bounds and the conditions for achieving these bounds in simple, clean, and comprehensive language of mathematics.