针对已有测试向量生成方法对以电路惰性节点作为输入的硬件木马触发覆盖率低的问题，提出了一种基于人工蜂群的测试向量生成方法.首先分析了用于触发惰性节点组合的测试向量的分布规律，并构建数学模型对其进行描述；然后利用人工蜂群算法生成测试向量，结合其分布规律对局部区域进行高效搜索以发现能触发更多惰性节点组合的测试向量，同时对全局进行快速搜索，有效避免了“早期收敛”问题.实验结果表明：使用本文方法生成的测试向量测试电路，对电路中惰性节点组合的平均触发覆盖率达到95.86%，与已有方法相比提高了22.43%，具有更好的硬件木马激活效果.
The exiting test pattern generation method have the problem of low trigger coverage for hardware Trojan detection. In order to solve this problem, a test pattern generation method based on artificial bee colony algorithm is proposed. Firstly, the distribution regularity of test patterns which can trigger the combination of inactive nets is analyzed. And the mathematical model is constructed to describe the test pattern. Then, the test pattern is generated by artificial bee colony algorithm. Combining with its distribution regularity, this method can search local regions efficiently to find test patterns that can trigger more combinations of inactive nets. At the same time, it can search global world quickly and effectively avoid the problem of "premature convergence". The experimental results show that using the test vectors generated by this method to test circuit, the average trigger coverage rate of hardware Trojan can reach 95.86%. Compared with the existing method, this method improves 22.43%, and has better hardware Trojan activation effect.
［1］GOERTZEL K M. Integrated circuit security threats and hardware assurance countermeasures［J］. Crosstalk Real-Time Information Assurance, 2013, 26(6): 33-38.
［2］BHUNIA S, ABRAMOVICI M, AGRAWAL D, et al. Protection against hardware Trojan attacks: Towards a comprehensive solution［J］. IEEE Design Test Computer, 2013, 30(3): 6-17.
［3］AGRAWAL D, BAKTIR S, KARAKOYUNLU D, et al. Trojan detection using IC fingerprinting［C］//Proceedings of the Symposium on Security and Privacy (SP). Berkeley, USA: IEEE, 2007: 296-310.
［4］BALASCH J, GIERLICHS B, VERBAUWHEDE I. Electromagnetic circuit fingerprints for hardware Trojan detection［C］//Proceedings of Electromagnetic Compatibility (EMC). Dresden, Germany: IEEE, 2015: 246-251.
［5］XIAO K, ZHANG X H, TEHRANIPOOR M. A clock sweeping technique for detecting hardware Trojans impacting circuits delay［J］. IEEE Design & Test, 2013, 30(2): 26-34.
［6］薛明富, 王箭, 胡爱群. 自适应优化的二元分类型硬件木马检测方法［J］. 计算机学报, 2017, 40(95): 1-14.
XUE Mingfu, WANG Jian, HU Aiqun. Adaptive optimization of two-class classification-based hardware Trojan detection method［J］. Journal of Computers, 2017, 40(95): 1-14.
［7］SALMANI H, TEHRANIPOOR M, PLUSQUELLIC J, et al. A novel technique for improving hardware Trojan detection and reducing Trojan activation time［J］. IEEE Transactions on Very Large Scale Integration Systems, 2012, 20(1): 112-125.
［8］CHAKRABORTY R S, WOLFF F G, PAUL S, et al. MERO: A statistical approach for hardware Trojan detection［C］//Proceedings of Cryptographic Hardware and Embedded Systems (CHES). Lausanne, Switzerland: Springer, 2009: 396-410.
［9］SAHA S, CHAKRABORTY RS, NUTHAKKI SS, et al. Improved test pattern generation for hardware Trojan detection using genetic algorithm and boolean satisfiability［C］//Proceedings of Cryptographic Hardware and Embedded Systems (CHES). Saint-Malo, France: Springer, 2015: 577-596.
［10］LESPERANCE N, KULKARNI S, CHENG K, et al. Hardware Trojan detection using exhaustive testing of k-bit subspaces［C］//Proceedings of Asia and South Pacific Design Automation Conference. Chiba, Japan: IEEE, 2015: 755-760.
［11］XUE M F, HU A Q, LI G Y. Detecting hardware Trojan through heuristic partition and activity driven test pattern generation［C］//Proceedings of Communications Security Conference (CSC). Beijing, China: IEEE, 2014: 1-6.
［12］ZHOU Z Q, GUIN U, VISHWANI D, et al. Modeling and test generation for combinational hardware Trojans ［C］//Proceedings of Electrical Engineering Seminar Series. San Francisco, USA: IEEE, 2018: 1-6.
［13］KARABOGA D. An idea based on honey bee swarm for numerical optimization［R］. Turkey: Technical Report-TR06, 2005: 1-10.
［14］EGGERSGLB S, DRECHSLER R. High quality test pattern generation and boolean satisfiablity［M］. Berlin: Springer Science & Business Media, 2012: 41-58.
