基于类梅森数的物联网密钥交换快速取模算法  

Fast Modulus Algorithm for Internet of Things Key Exchange Based on Mersenne-like Numbers

作　　者：覃健诚[1] 钟宇 程喆[4] 黄成海 陆以勤 潘伟锵[5] QIN Jiancheng;ZHONG Yu;CHENG Zhe;HUANG Chenghai;LU Yiqin;PAN Weiqiang(School of Electronic and Information Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China;Zhaoqing Branch of China Telecom,Zhaoqing 526000,Guangdong,China;School of Software Engineering,South China University of Technology,Guangzhou 510006,Guangdong,China;School of Computer Science and Engineering,South China University of Technology,Guangzhou 510006,Guangdong,China;Information and Network Engineering and Research Center,South China University of Technology,Guangzhou 510640,Guangdong,China)

机构地区：[1]华南理工大学电子与信息学院,广东广州510640 [2]中国电信广东肇庆分公司,广东肇庆526000 [3]华南理工大学软件学院,广东广州510006 [4]华南理工大学计算机科学与工程学院,广东广州510006 [5]华南理工大学信息网络工程研究中心,广东广州510640

出　　处：《华南理工大学学报（自然科学版）》2023年第5期24-35,共12页Journal of South China University of Technology(Natural Science Edition)

基　　金：广东省重点领域研发计划项目(2020B0101120002,2019B010137001);广东省科技厅海外名师项目(科技类)(粤财科教[2021]157号)。

摘　　要：为适应物联网加密传输中大量轻型传感器节点运算性能和能源有限的特点,解决传感器运行RSA(Rivest-Shamir-Adleman)、DHM(Diffie-Hellman-Merkle)、Elgamal等公钥基础设施(PKI)加密算法所面临的运算速度、功耗等瓶颈问题,并简化相应的硬件加密电路逻辑设计,文中提出了一种基于类梅森数的密钥交换快速取模算法(CZ-Mod算法)。CZ-Mod算法利用梅森数的数学特性,使关键的mod(取模)运算的时间复杂度降至O(n)。首先,提出了一种以类梅森数为模数的快速取模运算mod1,使复杂的mod运算变成简单的二进制移位相加运算;其次,提出了一种以任意近似类梅森数的正整数为模数的快速取模运算mod2,在简化mod运算的同时扩大模数的取值范围;然后,对mod1、mod2运算作逻辑电路设计,以简化mod运算的硬件电路;最后,将以上工作应用到物联网节点的密钥交换中,以降低计算的复杂度,提高PKI加密算法的速度。实验测试结果表明:采用CZ-Mod算法的DHM密钥交换速度可达到常规算法的2.5~4倍;CZ-Mod算法精简,适合做物联网传感器的硬件电路设计。In order to adapt to the limited computing performance and energy of numerous lightweight sensor nodes in the encrypted transmission of IoT(Internet of Things),this paper proposed a fast modulus algorithm(CZ-Mod algorithm)based on Mersenne-like numbers to slove the bottleneck problems of computing speed,power consumption and so on during the sensors run PKI(Public Key Infrastructure)encryption algorithms such as RSA(Rivest-Shamir-Adleman),DHM(Diffie-Hellman-Merkle),Elgamal,etc.,and to simplify the corresponding hardware encrypting circuit logic design.CZ-Mod algorithm uses the mathematic characteristics of Mersenne numbers,and lowers the time complexity of its essential operation mod(modulo)into O(n).Firstly,a fast modulus algorithm mod1 using Mersenne-like numbers as modulus was presented,changing complex mod operation into simple binary shift/add operation;secondly,a fast modulus algorithm mod2 using any positive integers near Mersenne-like numbers as modulus was presented,expanding the modulus value range while simplifying mod operation;and then logic circuits of mod1 and mod2 operations were designed,simplifying mod operation hardware circuit.Finally,the above work was applied to the key exchange of IoT nodes,so as to lower the computing complexity and improve the speed of PKI encryption algorithms.The experiment test results indicate that the speed of DHM key exchange with CZ-Mod algorithm can reach 2.5 to 4 times of that of the conventional algorithm;CZMod algorithm is concise and fits the hardware circuit design for the IoT sensors.

关 键 词：网络安全 传感器密码 梅森数 加密运算电路 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]