GF（2m）上ECC的BitSlice实现

On the BitSliced Implementation of ECC over GF（2~m）

BitSlice是加速分组密码软件实现的一种有效手段,文章将BitSlice技术引入到GF(2m)上的椭圆曲线密码中,给出了有限域运算和椭圆曲线运算的BitSlice实现和复杂度分析,实验结果表明,采用BitSlice方式实现的椭圆曲线点乘运算比传统方式实现的效率提升了17%左右。

BitSlice is an effective technique for improving the soft implementation of block cipher.This paper gives a research on how to bring this technique into the implementation of ECC over GF（2m）.The bitsliced algorithms of the arithmetic of finite field and elliptic curves are given in detail,and their computational complexity is analyzed.The experiment result shows that the bitsliced scalar multiplication of elliptic curves is about 15% faster than the conventional method.