A Class of Cartesian Authentication Codes Constructed from PG(n,q)
Xiuli Li · 2010
Let P be a point of projective space PG(n,q) (n ≥ 3 ) over field GF(q), π be a S-space through P in PG(n,q) (S ≥ 1). Let S be the source set composed of r- spaces through π (s1∈ S, π2∈ E, define f(π1, π2) = π1∩ π2, we have a class of Cartesian authentication codes. We compute the parameters of these codes. Assume that the encoding rules are chosen according to a uniform probability distribution, the largest probabilities of a successful impersonation attack PIand the largest probabilities of a successful substitution attack PSof these codes are also computed.