GF(2m)域ECC点乘算法优化设计  

Optimal Design of ECC Point Multiplication Algorithm over GF(2m)

作　　者：刘金龙 张玉婷 王尧 LIU Jin-long;ZHANG Yu-ting;WANG Yao(Naval Staff,Beijing 100841,China)

机构地区：[1]海军参谋部,北京100841

出　　处：《通信技术》2020年第6期1488-1494,共7页Communications Technology

摘　　要：针对无线传感器网络(Wireless Sensor Network,WSN)高安全、低功耗、轻量化的应用需求,重点对椭圆曲线密码体制的模乘和模逆运算作了优化设计,设计了一种GF(2m)域的ECC点乘计算优化方案,并进行了相应的硬件电路设计。经过FPGA平台仿真测试,在GF(2233)域上完成一次点乘运算共需要1.6444 ms,占用10682个Slices,相比于同类设计在计算速度和资源使用上都有明显改善,可以较好地适用于WSN等资源受限的场所。Aiming at the application requirements for high security,low power consumption and light weight of WSN(wireless sensor network),the optimal design of modular multiplication and modular inverse operation of elliptic curve cryptosystem is focused.An optimization scheme of ECC dot product calculation over GF(2m)is designed and the design of corresponding hardware circuit also done.Finally,the FPGA platform simulation test indicates that one elliptic curve scalar point multiplication over GF(2233)only takes 1.6444ms and occupies 10,682 Slices.Compared with similar designs,this solution has obvious improvement in computing speed and resource usage,and can be better applied to places with limited resources such as WSN.

关 键 词：WSN ECC 点乘运算 有限域模运算 

分 类 号：F407.67[经济管理—产业经济]