Premium
A problem of combinatorial designs related to authentication codes
Author(s) -
Pei Dingyi
Publication year - 1998
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1998)6:6<417::aid-jcd4>3.0.co;2-i
Subject(s) - mathematics , class (philosophy) , authentication (law) , combinatorial design , deception , finite field , combinatorics , spoofing attack , discrete mathematics , order (exchange) , construct (python library) , computer science , computer security , artificial intelligence , computer network , psychology , social psychology , finance , economics
The strong partially balanced t ‐designs can be used to construct authentication codes, whose probabilities P r of successful deception in an optimum spoofing attack of order r for r = 0, 1, …, t − 1, achieve their information‐theoretic lower bounds. In this paper a new family of strong partially balanced t ‐designs are constructed by means of rational normal curves over finite fields. Thus based on this new partially balanced t ‐designs a new class of authentication codes is obtained. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 417–429, 1998