Researchers 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 original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially balanced designs (SPBD).
Beginning with examples illustrating the concepts of authentication schemes and combinatorial designs, the book considers the probability of successful deceptions followed by schemes involving three and four participants, respectively. From this point, the author constructs the perfect authentication schemes and explores encoding rules for such schemes in some special cases.
Using rational normal curves in projective spaces over finite fields, the author constructs a new family of SPBD. He then presents some established combinatorial designs that can be used to construct perfect schemes, such as t-designs, orthogonal arrays of index unity, and designs constructed by finite geometry. The book concludes by studying definitions of perfect secrecy, properties of perfectly secure schemes, and constructions of perfect secrecy schemes with and without authentication.
Supplying an appendix of construction schemes for authentication and secrecy schemes, Authentication Codes and Combinatorial Designs points to new applications of combinatorial designs in cryptography.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Pei, Dingyi
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Paperback. Zustand: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Artikel-Nr. 6666-TNFPD-9780367391249
Anzahl: 5 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Artikel-Nr. 37659050-n
Anzahl: 13 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. pp. 256. Artikel-Nr. 385743254
Anzahl: 3 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: As New. Unread book in perfect condition. Artikel-Nr. 37659050
Anzahl: 13 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Artikel-Nr. I-9780367391249
Anzahl: Mehr als 20 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. pp. 256. Artikel-Nr. 18378160707
Anzahl: 3 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Artikel-Nr. ria9780367391249_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Buchpark, Trebbin, Deutschland
Zustand: 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. Artikel-Nr. 35475862/1
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 256 pages. 9.21x6.14x0.55 inches. In Stock. Artikel-Nr. x-0367391244
Anzahl: 2 verfügbar
Anbieter: Home-set, Mannheim, Deutschland
Softcover/Taschenbuch. Zustand: Neu. 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. Sprache: Englisch Gewicht in Gramm: 392. Artikel-Nr. IB-11579219
Anzahl: 2 verfügbar