A Class of Cartesian Athentication Codes from PG(n,q)
Zhao Pi-qing · Science Technology and Engineering · 2010
Let P be a point in projective space PG(n,q) over GF(q),L be a line through P in PG(n,q).Let S be the source set composed of hyperplanes through L,E be the encode rules set composed of hyperplanes which intersect with L at P,M be the message set composed of n-2-subspaces which intersect with L at P.For any π1∈S,π2∈E,define f(π1,π2)=π1∩π2.A class of Cartesian authentication codes is presented.The parameters of these codes is computed.Assume that the encoding rules are chosen according to a uniform probability distribution,the largest probabilities of a successful impersonation attack PI and the largest probabilities of a successful substitution attack PS of these codes are also computed.