论文部分内容阅读
本文从分析有限域的结构开始,给出了一类有限域GF(2~n)中乘法的快速实现方法。同时,也指出了该方法在椭圆曲线密码体制中的重要意义。
In this paper, starting with the analysis of the structure of finite fields, a fast implementation of multiplication in a finite field GF (2 ~ n) is given. At the same time, it also points out the significance of this method in elliptic curve cryptography.