Analysis of inverse algorithm and representation on binary finite fields

Abstract

Keywords:
• binary finite field,
• polynomial basis,
• regular basis,
• multiplicative inverse

References

1. [1]

   Mullin R C,Onyszchuk I,Vanstone S A,et al.Optimal normal bases in GF(pⁿ)[J].Dise Appl Math,1988/1989,22:149.

2. [2]

   谭丽娟,陈运.模逆算法的分析、改进和测试[J].电子科技大学学报,2004,33(4):383.
   

3. [3]

   王健,蒋安平,盛世敏.椭圆曲线加密体制的双有限域算法及其FPGA实现[J].北京大学学报:自然科学版,2008(6):873.
   

4. [4]

   Schroepel R,Orman H,Malley S O',et al.Fask key exchange with elliptic curve systems,advances in cryptology[C]//Proc Crypto'95 LNCS963,Springer-Verlag,1995:43-56.

5. [5]

   Kaliski B S.The montgomery inverse and its applications[J].IEEE Trans on Comp,1995,44(8):1064.

6. [6]

   郝晓琴,徐赐文.椭圆曲线加密体制的有限域求模逆算法的改进[J].中央民族大学学报:自然科学版,2009,11(18):143.
   

7. [7]

   徐茂智,游林.信息安全与密码学[M].北京:清华大学出版社,2007.
   

Proportional views