计算机与数字工程2023，Vol.51Issue(10)：2263-2266,2273,5.DOI:10.3969/j.issn.1672-9722.2023.10.009
基于GF(2m)域上Ⅱ型最优正规基的模乘算法及实现
Modular Multiplication Algorithm and Implementation Based on Type-ⅡOptimal Normal Basis over GF(2m)
高照 1王庆年 1樊荣1
作者信息
- 1. 中国船舶集团有限公司第722研究所 武汉 430205
- 折叠
摘要
Abstract
In this paper,a new method of using type Ⅱ normal basis for multiplication is proposed.By an efficient linear transformation,the regular basis of GF(2m)is transformed into m-term polynomials over GF(2m).This polynomial can be multi-plied using any polynomial multiplication algorithm and then converted back to a normal basis using the inverse of the transformation described above.The XOR/AND operations required for this scheme are M(m)+2mlog2(m 2),where M(m)depends on the poly-nomial multiplication algorithm chosen.Compared with other normal basis methods,it has smaller resource consumption.The FPGA comprehensive practice shows that this scheme can significantly reduce the number of LUTs.关键词
最优正规基/重序正规基/正规基乘法Key words
optimal normal basis/permuted normal basis/normal basis multiplication分类
信息技术与安全科学引用本文复制引用
高照,王庆年,樊荣..基于GF(2m)域上Ⅱ型最优正规基的模乘算法及实现[J].计算机与数字工程,2023,51(10):2263-2266,2273,5.
