Abstract:
This article brings forward a design method of realization of multip lication in finite field GF (2m) using logarithmic shift structure. This article sets forth the realization of multiplication in detail after analyzing multipli cation in finite field GF (2m) and introducing logarithmic shift structure. Acco rding to this method, which has speed advantage, multiplication in finite field can complete in one system clock.
摘要： 提出了一种基于对数移位结构实现GF(2m)上乘法运算的设计方法。在对有限域乘 法进行分析及对对数移位结构进行介绍的基础上，对乘法实现进行了详细阐述。该设计方法 可以在一个时钟内完成有限域乘法，其运算速度优势非常明显。
关键词:
对数移位,
有限域GF(2m)乘法,
密码算法
CLC Number:
ZHANG Wenjing1,LIU Ming2,ZHOU Tao2, LU Shuwang1. Design of the Fast Implementation of Multiplication in Finite Field[J]. , 2003, 29(11): 3-5.
张文婧,刘鸣,周涛,吕述望. 有限域上乘法运算快速实现的设计[J]. , 2003, 29(11): 3-5.