作者：刘桂雄1, 张龙1, 徐钦桂2
作者单位：1. 华南理工大学机械与汽车工程学院, 广东 广州 510640;
2. 东莞理工学院, 广东 东莞 523808
关键词：物联网监测节点; 完整性; 改进SHA-1散列算法
摘要：
针对物联网监测节点完整性问题,提出一种适用于物联网监测节点的基于改进SHA-1物联网监测节点完整性验证与增强方法。引入基于SHA-1的不变属性融合增强算法技术,提出改进SHA-1散列算法思想、结构与流程。性能仿真分析表明:改进SHA-1散列算法的防碰撞性能及混乱与散布性能较SHA-1算法有明显改善,其改变明文消息1个比特带来的数字指纹平均距离与理论值仅偏差0.54%,置乱数均值从80.358 3下降到80.010 7。
Method of integrity verification and enhancement of monitoring nods of internet of things based on improved SHA-1
LIU Gui-xiong1, ZHANG Long1, XU Qin-Gui2
1. School of Mechanical and Automotive Engineering, South China University of Technology, Guangzhou 510640, China;
2. Dongguan University of Technology, Dongguan 523808, China
Abstract: Aiming at the question of integrity of monitoring nods of Inernet of Things, a method was proposed for integrity verification and enhancement of monitoring nods of Internet of Things based on improved SHA-1. The technology of invariant properties fusion enhancement algorithm based on SHA-1 was introduced, and the thought,structure and flow of improved SHA-1 hash algorithm were proposed. Performance simulating demonstrates that the anti-collision performance and chaos and interspersion performance of the improved SHA-1 hash algorithm is much better than SHA-1. Compared with SHA-1, the average distance of digital fingerprints caused by improved SHA-1 hash algorithm may change 1 bit of plaintext, a deviation of 0.54% to theoretical value. And the average value of scrambing numbers decreased from 80.358 3 to 80.010 7.
Keywords: monitoring nods of Inernet of Things; integrity; improved SHA-1 hash algorithm
2013, 39(1): 80-83 收稿日期: 2012-8-19;收到修改稿日期: 2012-9-29
基金项目: 广东省高层次人才项目(粤教师函[2010]79号)
作者简介: 刘桂雄(1968-),男,广东广州市人,教授,博士生导师,主要从事智能传感与检测技术研究。
参考文献
[1] 宁焕生,徐群玉. 全球物联网发展及中国物联网建设若干思考[J]. 电子学报,2010,38(11):2590-2599.
[2] 单红. 一组完整性校验算法极其效率分析[J]. 安徽大学学报:自然科学版,2004,31(5):28-31.
[3] Weber R H. Internet of things-new security and privacy challenges[J]. Computer Law & Security Review,2010(26):23-30.
[4] Wang X Y, Yin Y L, Yu H B. Finding collisions in the full SHA-1[C]//In Victor Shoup, editor,Advances in Cryptology-CRYPTO'05,Lecture Notes in Computer Science, 2005,3621:17-36.
[5] Wang X Y, Yin Y L, Yu H Bo. Efficient collision search at tacks on SHA-0[C]//In Victor Shoup,editor,Advances in Cryptology-CRYPTO'05,Lecture Notes in Computer Science, 2005,3621:1-16.
[6] Xie T, Feng D G. How to find weak input differences for MD5 collision attacks[OIML],2009. http://eprint.iacr.org/2009/223.pdf.1-20.
[7] 李恒,徐自励,金立杰. 数据关联方法在对点定位系统中的应用[J]. 中国测试,2012(5):69-72.
[8] YI X. Hash function based on chaotic tent maps[J]. IEEE Transactions on Circuits and Systems-Ⅱ:Express. briefs,2005,52(6):354-357.
