Authentication Codes and Combinatorial Designs
Regular price
€173.60
14 days return policy
Shipping & Delivery
A01=Dingyi Pei
advanced combinatorics
Authentication Scheme
Author_Dingyi Pei
Category=PB
Category=URY
Combinatorial Bounds
Combinatorial Design
Conditional Probability Distribution
cryptographic protocols
decoding
Decoding Rule
encode
Encoded Messages
encoding
Encoding Rules
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
finite geometry
Fraudulent Message
Information Theoretic Bound
integer
Latin Square
Linear Code
mathematical statistics
MDS Code
message
Mod 12
Mol
Orthogonal Arrays
Orthogonal Latin Squares
Parity Check Matrix
perfect secrecy construction schemes
positive
probability theory
Reed Solomon Code
RNC
rule
scheme
secure communication
source
state
Steiner Triple System
T-dimensional Subspace
Transversal Design
Uniform Probability Distribution
Unique Block
Vice Versa
Product details
- ISBN 9781584884736
- Weight: 498g
- Dimensions: 156 x 234mm
- Publication Date: 13 Jan 2006
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
Pei, Dingyi
