张艺与, 赵海军, 贺春林, 陈毅红. 基于椭圆曲线的RFID电子标签加密算法研究[J]. 云南大学学报(自然科学版), 2021, 43(1): 60-67. doi: 10.7540/j.ynu.20200118
引用本文: 张艺与, 赵海军, 贺春林, 陈毅红. 基于椭圆曲线的RFID电子标签加密算法研究[J]. 云南大学学报(自然科学版), 2021, 43(1): 60-67. doi: 10.7540/j.ynu.20200118
ZHANG Yi-yu, ZHAO Hai-jun, HE Chun-lin, CHEN Yi-hong. The research of RFID tag encryption algorithm based on ECC[J]. Journal of Yunnan University: Natural Sciences Edition, 2021, 43(1): 60-67. DOI: 10.7540/j.ynu.20200118
Citation: ZHANG Yi-yu, ZHAO Hai-jun, HE Chun-lin, CHEN Yi-hong. The research of RFID tag encryption algorithm based on ECC[J]. Journal of Yunnan University: Natural Sciences Edition, 2021, 43(1): 60-67. DOI: 10.7540/j.ynu.20200118

基于椭圆曲线的RFID电子标签加密算法研究

The research of RFID tag encryption algorithm based on ECC

  • 摘要: 针对物联网核心技术射频识别中电子标签数据加密问题进行研究,优化了椭圆曲线加密体制的底层标量乘法,提出一种改进的PECC-NAF标量乘算法,以此来解决RIFD系统硬件资源受限和高安全性需求之间的矛盾. 首先,利用NAF标量乘方法降低标量的汉明重量;然后,利用任务分解策略和并行结构将标量乘中点加和倍乘操作并行执行;最后,通过仿真实验验证本算法的计算效率及安全性并与其他算法进行对比,证明本算法的优越性. 实验结果表明,与传统的二进制标量乘算法相比较,在160 bit和255 bit密钥长度下,运用提出的标量乘算法可以将标量乘算法的运行时间分别提升5倍和3倍.

     

    Abstract: This article studies the encryption of electronic tag data in the core technology of the Internet of Things,the underlying scalar multiplication of elliptic curve encryption system is optimized, and proposes an improved PECC-NAF scalar multiplication algorithm to resolve the contradiction between the limited hardware resources and high security requirements of the RFID system. First, the NAF scalar multiplication method is used to reduce the hamming weight of the scalar. Then, through the task decomposition strategy and parallel structure, the scalar multiplication doubling operations and adding operation are performed in parallel. Finally, simulation experiments are carried out to verify the computational efficiency and security of this algorithm and compare it with other algorithms to prove the superiority of this algorithm. The experimental results show that compared with the traditional binary scalar multiplication algorithm, under 160-bit and 255-bit key lengths, using the scalar multiplication algorithm proposed in this paper can reduce the running time of the scalar multiplication algorithm to one-fifth and one-third of the original.

     

/

返回文章
返回