排序方式: 共有5条查询结果,搜索用时 0 毫秒
1
1.
Let G be the finite cyclic group Z_2 and V be a vector space of dimension 2n with basis x_1,...,x_n,y_1,...,y_n over the field F with characteristic 2.If σ denotes a generator of G,we may assume that σ(x_i)= ayi,σ(y_i)= a~-1x_i,where a ∈ F.In this paper,we describe the explicit generator of the ring of modular vector invariants of F[V]~G.We prove that F[V]~G = F[l_i = x_i + ay_i,q_i = x_iy_i,1 ≤ i ≤ n,M_I = X_I + a~-I-Y_I],where I∈An = {1,2,...,n},2 ≤-I-≤ n. 相似文献
2.
3.
利用有限域上一类幂零阵的标准形构造Cartesian认证码 总被引:1,自引:0,他引:1
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. 相似文献
4.
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 au- thentication 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. 相似文献
5.
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. 相似文献
1