Abstract
The authentication codes based on the rational normal curves in projective spaces over finite fields were the first construction of the non-Cartesian t-fold perfect authentication codes for arbitrary positive integer t. In this paper it shows that the subfield rational normal curves provide a new family of such codes, its expected probabilities of successful deception for optimal spoofing attacks are less than those probabilities of former constructed codes in most cases.
This work was supported by NSFC (No. 60473017 and 90604034) of China.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pei, D.: A problem of combinatorial designs related to authentication codes. Journal of Combinatorial Designs 6, 417 (1998)
Pei, D.: Authentication codes and combinatorial designs. Chapman & Hall/CRC, Boca Raton (2006)
Simmons, G.L.: Authentication theory / coding theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, p. 411. Springer, Heidelberg (1985)
Witt, E.: Dei fünffan tromsitiven Gruppen von Mathien. Abhandlungen der Mathematik Hamburg 12, 256 (1938)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pei, D. (2009). New Family of Non-Cartesian Perfect Authentication Codes. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds) Coding and Cryptology. IWCC 2009. Lecture Notes in Computer Science, vol 5557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01877-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-01877-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01813-8
Online ISBN: 978-3-642-01877-0
eBook Packages: Computer ScienceComputer Science (R0)