2009 | OriginalPaper | Chapter
New Family of Non-Cartesian Perfect Authentication Codes
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.