A Class of Cartesian Athentication Codes from PG(3,q)
LI Xiu-li · Journal of Qingdao University of Science and Technology · 2010
Let P be a point in projective space PG(3,q) over GF(q),L be a line through P in PG(3,q).Let S be the source set composed of planes through L,E be the encode rules set composed of planes which intersect with L at P,M be the message set composed of lines which intersect with L at P.For any π1∈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 PI and the largest probabilities of a successful substitution attack PS of these codes are also computed.