1) finite primary field
有限素域
1.
This paper proves that the omni-direction permutations constructed by recurring shift Latin square Dp and Latin square Wp on the finite primary field Fp must be complete mappings on Abelian group Fp, and prove that these omni-direction permutations are also linear functions on Fp.
证明了利用有限素域Fp上的循环移位拉丁方Dp和拉丁方Wp产生的全向置换必定是Fp加群上的完全映射,而且这类全向置换一定是F上的线性函数。
2) finite prime number field
有限素数域
1.
This paper analyzes on how to construct the encryption system on the elliptic curves which based on finite prime number field GF(p).
本文针对基于有限素数域GF(p)的椭圆曲线如何构造加密系统进行了分析,并且提出了一种简单的基于有限素数域的椭圆曲线加密系统(SECES)的实现模型,此系统对MOV方法、Smart方法等各种方法的攻击具有明显效果。
3) finite field
有限域
1.
Construction of the secure elliptic curves over the finite field F_(2~n);
有限域F_(2~n)上安全椭圆曲线的构造
2.
Construction of Cartesian authentication code from alternate matrices over finite fields;
利用有限域上交错矩阵构造Cartesian认证码
3.
Semi-fragile watermarking algorithm based on operations over finite field;
一种基于有限域运算的半脆弱数字水印算法
4) finite extension fields
有限扩域
1.
Based on the construct idea of prime codes and the transformation relation between finite ground fields and finite extension fields,the construction of concatenated prime codes was analyzed in polynomials form and the finite field model was deduced.
基于素数码的构造思想和有限基域与有限扩域的变换关系,通过分析级联素数码构造过程的多项式表示,得出级联素数码的有限域模型,表明级联素数码是以某一类二次既约多项式为模的有限扩域域乘法某种变形的结果,将级联素数码的构造与有限扩域域乘法相关联,并基于此得出确定级联素数码码族个数的规律。
5) finite fields
有限域
1.
Using normal form of Hermite matrices over finite fields to construct cartesian authentication codes;
利用有限域上Hermite矩阵的标准型构造卡氏认证码
2.
Constructing Cartesian authentication codes from trace functions over finite fields;
用有限域上迹函数构造Cartesian认证码
3.
This paper describes a new construction of authentication codes with arbitration using sympletic geometry over finite fields,and their size parameters are computed.
笔者给出了利用有限域上的辛几何构造一个具有仲裁的认证码,计算了其容量参数。
6) Galois Field
有限域
1.
The arithmetic operations in Galois field is central in the implementation of Reed-Solomon coders,storage and cryptographic algorithms.
有限域的运算已经广泛应用于Reed-Solomon码、存储领域和各种加密算法中。
2.
The second method is using the inverse transformation in Galois field.
S-Box是AES密码算法硬件实现的关键,目前主要有两种实现方法:一种是基于查找表,一种是基于有限域求逆。
3.
Based on the theory of polynomial multiplications in Galois field, an 8-bit fast multiplier in (GF(2~8)) is designed using the higher hierarchy technique, and the VHDL model of the multiplier is presented.
基于有限域上多项式乘法理论,采用高层次设计方法,采用CPLD实现了GF(28)上8位快速乘法器,利用XILINX公司的FoundationSeries3。
补充资料：素域
素域
prime field
素域【p如祀右dd;。pocT0e no爬〕 不包含其子域的域.每个域都包含一个唯一的素域.特征为0的素域与有理数域同构特征为P的素域同构于整数模p的域Z/pZ.
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条