Authentication Codes and Combinatorial Designs
List Price:
$94.99
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
Dingyi Pei
Format:
Paperback
Pages:
256
Publisher:
CRC Press (September 5, 2019)
Language:
English
ISBN-13:
9780367391249
Weight:
12oz
Dimensions:
6.125" x 9.1875"
File:
TAYLORFRANCIS-TayFran_260711045646290-20260711.xml
Folder:
TAYLORFRANCIS
List Price:
$94.99
Country of Origin:
United States
Series:
Discrete Mathematics and Its Applications
Case Pack:
10
As low as:
$90.24
Publisher Identifier:
P-CRC
Discount Code:
H
Pub Discount:
30
Imprint:
Chapman and Hall/CRC
Overview
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.
