Advances and Applications in Discrete Mathematics
Volume 10, Issue 2, Pages 65 - 75
(October 2012)
|
|
AN EXTENSION OF AUTHENTICATION CODES BASED ON BIBDS
Nobuko Miyamoto and Satoshi Shinohara
|
Abstract: We consider authentication codes without splitting. Constructions for the codes where the deception probabilities meet the lower bounds with equality have used combinatorial designs such as orthogonal arrays and BIBDs (balanced incomplete block designs). In this paper, we give an extension of a construction for authentication codes having perfect secrecy in order to get an authentication code where no BIBD exists. Moreover we show that the obtained codes asymptotically attain the lower bounds when the order q of the base filed is large enough. |
Keywords and phrases: authentication codes, BIBDs. |
|
Number of Downloads: 240 | Number of Views: 600 |
|