Two constructions of cartesian authentication codes from unitary geometry are given in this paper. Their size parameters and their probabilities of successful impersonation attack and successful substitution attack ar...Two constructions of cartesian authentication codes from unitary geometry are given in this paper. Their size parameters and their probabilities of successful impersonation attack and successful substitution attack are computed. They are optimal under some cases.展开更多
In the present paper, we compute the number of the symplectic involutions over the finite field F with charF = 2, and also one Cartesian authentication code is obtained. Furthermore, its size parameters are computed c...In the present paper, we compute the number of the symplectic involutions over the finite field F with charF = 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.展开更多
A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of...A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of success for different types of deceptions are also computed.展开更多
An A^3-code is extension of A^2-code in which none of the three participants： transmitter, receiver and arbiter, is assumed trusted. In this article, from projective geometry over finite fields, two A^3 -codes were g...An A^3-code is extension of A^2-code in which none of the three participants： transmitter, receiver and arbiter, is assumed trusted. In this article, from projective geometry over finite fields, two A^3 -codes were given, the parameters, and probabilities of successful attacks were computed.展开更多
基金Supported by the National Natural Science Foundation of China(No.61179026,61262057)the Fundamental Research Funds of the Central Universities of China(No.ZXH2012K003,3122013K001)
文摘Two constructions of cartesian authentication codes from unitary geometry are given in this paper. Their size parameters and their probabilities of successful impersonation attack and successful substitution attack are computed. They are optimal under some cases.
基金Supported by the National Natural Science Foundation of China（10771023）
文摘In the present paper, we compute the number of the symplectic involutions over the finite field F with charF = 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.
基金Foundation item： the National Natural Science Foundation of China （No. 60776810） the Natural Science Foundation of Tianjin City （No. 08JCYBJC13900）.
文摘A construction of authentication codes with arbitration from singular pseudo-symplectic geometry over finite fields is given and the parameters of the code are computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the probabilities of success for different types of deceptions are also computed.
文摘An A^3-code is extension of A^2-code in which none of the three participants： transmitter, receiver and arbiter, is assumed trusted. In this article, from projective geometry over finite fields, two A^3 -codes were given, the parameters, and probabilities of successful attacks were computed.
