Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules...Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.展开更多
In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probab...In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.展开更多
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 this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are ch...In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the P I and P S , which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed.展开更多
文摘Let Fq be a finite field. In this paper, a construction of Cartesian au-thentication codes from the normal form of a class of nilpotent matrices over the field Fq is presented. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probabilities PI and PS, of a successful im-personation attack and of a successful substitution attack respectively, of these codes are also computed.
基金Foundation item:The Key Project(03060)of Chinese Ministry of Education.
文摘In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.
基金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.
文摘In this paper, one construction of Cartesian authentication codes from the normal form of matrices over finite fields are presented and its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the P I and P S , which denote the largest probabilities of a successful impersonation attack and of a successful substitution attack respectively, of these codes are also computed.
文摘In this paper, two new constructions of Cartesian authentication codes from symplectic geometry are presented and their size parameters are computed.
