In the present paper, we compute the number of the symplectic involaLions over the finite field F with chafF = 2, and also one Cartesian authentication code is obtained.Furthermore, its size parameters are computed co...In the present paper, we compute the number of the symplectic involaLions over the finite field F with chafF = 2, and also one Cartesian authentication code is obtained.Furthermore, its size parameters are computed completely. If assume that the coding rules are chosen according to a uniform probability, PI and Ps denote the largest probabilities of a successful impersonation attack and a successful substitution attack respectively, then PI and Ps are also computed.展开更多
基金Supported by the National Natural Science Foundation of China（10771023）
文摘In the present paper, we compute the number of the symplectic involaLions over the finite field F with chafF = 2, and also one Cartesian authentication code is obtained.Furthermore, its size parameters are computed completely. If assume that the coding rules are chosen according to a uniform probability, PI and Ps denote the largest probabilities of a successful impersonation attack and a successful substitution attack respectively, then PI and Ps are also computed.
