论文部分内容阅读
在有限域的基本运算中,乘法逆元的计算是最费时间的运算。提出了一种改进的欧几里德计算乘法逆元的算法,与原方法相比该方法在大的域中能够较大的降低算法的时间复杂度,同时也给出了乘法逆元的硬件实现结构。
In the basic operations of finite fields, the calculation of multiplicative inverse elements is the most time-consuming operation. An improved Euclidean algorithm for computing the inverse of multiplication is proposed. Compared with the original method, this method can greatly reduce the time complexity of the algorithm in the large domain, and also gives the hardware of the multiplicative inverse element Realize the structure.