面向RFID应用的GF(2~m)域上ECC点乘运算的轻量化改进研究  

ECC point multiplication lightweight improvement for RFID applications over GF(2~m)

作　　者：魏国珩[1,2] 汪亚[2] 张焕国[1] WEI Guo-heng WANG Ya ZHANG Huan-guo(School of Computer,Wuhan University,Wuhan 430072 Department of Information Security,Naval University of Engineering,Wuhan 430033,China)

机构地区：[1]武汉大学计算机学院,湖北武汉430072 [2]海军工程大学信息安全系,湖北武汉430033

出　　处：《计算机工程与科学》2017年第1期81-85,共5页Computer Engineering & Science

基　　金：国家自然科学基金(61332019);国防973项目(2014CB340600)

摘　　要：针对RFID等资源受限的特殊应用,选取安全性能较高的椭圆曲线算法进行轻量化改进研究,对其核心部分点乘运算中的模乘、模逆算法进行了改进,采用整体串行、部分并行的方式对算法执行结构进行了重新设计。经在FPGA上仿真验证,对比其他方案,改进后的算法在芯片占用面积和执行速度上有明显的综合优势,适用于RFID等资源受限的应用场合。Aiming at the special applications of resource constrained devices such as RFID, we employ the elliptic curve algorithm with high security performance to improve the lightweight of point multiplication. We improve the modular multiplication and the inversion algorithm for the point multiplication in the core part, and redesign the algorithm execution structure by using the whole serial and partial parallel method. We implement the improved algorithm on FPGA, and experimental results show that it has obvious advantages in speed and chip occupied area, and is suitable for resource constrained applications such as RFID.

关 键 词：椭圆曲线密码 射频识别 二进制域 点乘 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]