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.展开更多
An orbit code is a special constant dimension subspace code,which is an orbit of a subgroup of a general linear group acting on the set of all subspaces in the given ambient space.This paper presents some methods of c...An orbit code is a special constant dimension subspace code,which is an orbit of a subgroup of a general linear group acting on the set of all subspaces in the given ambient space.This paper presents some methods of constructing new orbit codes from known orbit codes.Firstly,we introduce the sum operation,intersection operation and union operation of subspace codes,and then we give some methods to obtain new orbit codes from known orbit codes by fully applying the sub-orbits of permutation groups and the direct product operation of the groups.Finally,as a special application,partial spread codes are researched and a condition of orbit codes with constant distance is given.展开更多
In a common authentication code with arbitration, the dishonest arbiter may make a threat to the security of authentication system. In this paper, an authentication code with double arbiters over symplectic geometry i...In a common authentication code with arbitration, the dishonest arbiter may make a threat to the security of authentication system. In this paper, an authentication code with double arbiters over symplectic geometry is constructed, and the relevant parameters and the probabilities of successful attacks are calculated. The model not only prevents deception from the opponent and members of the system, but also effectively limits the attacks of single arbiter. Moreover, the collusion attacks from arbiters and participators are difficult to succeed.展开更多
基金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.
基金This paper is supported by the Fundamental Research Funds of the Central Universities of China Civil Aviation University of Key Projects of Natural Science(No.3122019192).
文摘An orbit code is a special constant dimension subspace code,which is an orbit of a subgroup of a general linear group acting on the set of all subspaces in the given ambient space.This paper presents some methods of constructing new orbit codes from known orbit codes.Firstly,we introduce the sum operation,intersection operation and union operation of subspace codes,and then we give some methods to obtain new orbit codes from known orbit codes by fully applying the sub-orbits of permutation groups and the direct product operation of the groups.Finally,as a special application,partial spread codes are researched and a condition of orbit codes with constant distance is given.
基金Supported by the National Natural Science Foundation of China(No.61179026)the Fundamental Research Funds For the Central Universities(No.3122013K001)
文摘In a common authentication code with arbitration, the dishonest arbiter may make a threat to the security of authentication system. In this paper, an authentication code with double arbiters over symplectic geometry is constructed, and the relevant parameters and the probabilities of successful attacks are calculated. The model not only prevents deception from the opponent and members of the system, but also effectively limits the attacks of single arbiter. Moreover, the collusion attacks from arbiters and participators are difficult to succeed.
