Please wait a minute...
浙江大学学报(工学版)  2019, Vol. 53 Issue (8): 1546-1551    DOI: 10.3785/j.issn.1008-973X.2019.08.013
计算机与控制工程     
基于遗传算法的少态节点活性提升方法
刘尚典1,2(),赵毅强1,2,*(),刘燕江1,2,何家骥1,2,原义栋1,3,于艳艳3
1. 天津大学 微电子学院,天津 300072
2. 天津大学 天津市成像与感知微电子技术重点实验室,天津 300072
3. 北京智芯微电子科技有限公司 北京市电力高可靠性集成电路设计工程技术研究中心,北京 100192
A rare node activity improvement method based on genetic algorithm
Shang-dian LIU1,2(),Yi-qiang ZHAO1,2,*(),Yan-jiang LIU1,2,Jia-ji HE1,2,Yi-dong YUAN1,3,Yan-yan YU3
1. School of Microelectronics, Tianjin University, Tianjin 300072, China
2. Tianjin Key Laboratory of Imaging and Sensing Microelectronic Technology, Tianjin University, Tianjin 300072, China
3. Beijing Engineering Research Center of High-reliability IC with Power Industrial Grade, Beijing Smart-Chip Microelectronics Technology Co. Ltd, Beijing 100192, China
 全文: PDF(1184 KB)   HTML
摘要:

为了进一步提高对硬件木马的识别水平,利用遗传算法的全局搜索能力,提出基于遗传算法的少态节点活性提升方法,以少态节点的翻转次数代表活性,寻找能提升少态节点活性的测试向量集. 在测试向量激励下,将被测电路中少态节点的翻转次数作为适应度,在整个测试向量空间内进行选择、交叉和变异操作,并比较父代与子代适应度,保留适应度较大的向量集,最终达到迭代终止条件,生成优化的测试向量集.以ISCAS'85基准电路c3540为研究对象进行仿真验证,实验结果表明,在算法运行前,以1 000个向量为输入时,电路所有非少态节点的翻转次数之和为155 158,少态节点的翻转次数之和为117;在算法运行后,以1 000个向量为输入时,电路所有非少态节点的翻转次数之和为157 146,少态节点的翻转次数之和为882. 遗传算法生成的测试向量组将少态节点的翻转率提高了7.54倍,并将相对翻转率提升了7.44倍.

关键词: 硬件木马翻转率少态节点木马检测逻辑测试    
Abstract:

In order to improve the identification level of hardware Trojan, a rare node activity improvement method based on genetic algorithm was proposed, by using the global searching ability of genetic algorithm. The proposed method was used to search the test vector sets which could improve the activity of rare nodes, by taking the toggle count of rare nodes as activity. Under the excitation of the test vector, the transition count of rare nodes in device under test (DUT) was taken as fitness, and the operations of selection, crossover and mutation were conducted during the whole test vector space. The fitness of parent and the fitness of offspring were compared, and the higher fitness test vector sets were saved, and eventually the optimized test vector set was generated by iteration when the iteration termination condition was reached. Simulation verification was conducted with the ISCAS'85 benchmark circuit c3540 as research object. Results showed that before the operation of the algorithm, when 1 000 vectors were used as input, the sum of the transition times of the un-rare nodes was 155 158, and the sum of the transition times of the rare nodes was 117. After the operation of the algorithm, when 1 000 vectors were used as input, the sum of the transition times of the un-rare nodes was 157 146, and the sum of the transition times of the rare nodes was 882. The test vectors generated by genetic algorithm improved the transition rate of rare nodes up to 7.54 times, and increased the relative transition rate of rare nodes up to 7.44 times.

Key words: hardware Trojan    transition rate    rare node    Trojan detection    logic test
收稿日期: 2018-07-07 出版日期: 2019-08-13
CLC:  TN 47  
通讯作者: 赵毅强     E-mail: 2541901827@qq.com;yq_zhao@tju.edu.cn
作者简介: 刘尚典(1993—),男,硕士生,从事硬件安全检测研究. orcid.org/0000-0003-1032-3922. E-mail: 2541901827@qq.com
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
作者相关文章  
刘尚典
赵毅强
刘燕江
何家骥
原义栋
于艳艳

引用本文:

刘尚典,赵毅强,刘燕江,何家骥,原义栋,于艳艳. 基于遗传算法的少态节点活性提升方法[J]. 浙江大学学报(工学版), 2019, 53(8): 1546-1551.

Shang-dian LIU,Yi-qiang ZHAO,Yan-jiang LIU,Jia-ji HE,Yi-dong YUAN,Yan-yan YU. A rare node activity improvement method based on genetic algorithm. Journal of ZheJiang University (Engineering Science), 2019, 53(8): 1546-1551.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2019.08.013        http://www.zjujournals.com/eng/CN/Y2019/V53/I8/1546

图 1  节点A的逻辑状态转移图
图 2  遗传算法的交叉操作
图 3  遗传算法的变异操作
节点名称 逻辑0时间 逻辑1时间 P
G3537 421 99 579 0.008 36
n456 747 99 253 0.014 86
n651 99 242 758 0.015 10
n641 99 232 768 0.015 22
n415 99 226 774 0.015 36
n457 774 99 226 0.015 38
n433 99 200 800 0.015 92
n471 825 99 175 0.016 36
表 1  少态节点的动态翻转率
图 4  种群适应度随运算次数的变化
节点名称 逻辑0时间 逻辑1时间 P
G3537 11 989 0.022
n456 24 976 0.048
n651 908 92 0.184
n641 915 85 0.170
n415 911 89 0.176
n457 25 975 0.050
n433 907 93 0.186
n471 23 977 0.046
表 2  优化后少态节点的动态翻转率
图 5  算法运行前后电路节点翻转率分布
1 AGRAWAL D, BAKTIR S, KARAKOYUNLU D, et al. Trojan detection using IC fingerprinting [C]// IEEE Symposium on Security and Privacy. [S.l.]: IEEE, 2007: 296-310.
2 TEHRANIPOOR M, KOUSHANFAR F A survey of hardware Trojan taxonomy and detection[J]. IEEE Design and Test of Computers, 2010, 27 (1): 10- 25
doi: 10.1109/MDT.2010.7
3 BHUNIA S, HSIAO M S, BANGA M, et al Hardware Trojan attacks: threat analysis and countermeasures[J]. Proceedings of the IEEE, 2014, 102 (8): 1229- 1247
doi: 10.1109/JPROC.2014.2334493
4 SAAD W, SANJAB A, WANG Y, et al Hardware Trojan detection game: a prospect-theoretic approach[J]. IEEE Transactions on Vehicular Technology, 2017, 66 (9): 7697- 7710
doi: 10.1109/TVT.2017.2686853
5 JACOB N, MERLI D, HEYSZL J, et al Hardware Trojans: current challenges and approaches[J]. IET Computers and Digital Techniques, 2014, 8 (6): 264- 273
doi: 10.1049/iet-cdt.2014.0039
6 CHAKRABORTY R S, PAGLIARINI S, MATHEW J, et al A flexible online checking technique to enhance hardware Trojan horse detectability by reliability analysis[J]. IEEE Transactions on Emerging Topics in Computing, 2017, 5 (2): 260- 270
7 CHAKRABORTY R S, WOLFF F, PAUL S, et al. MERO: a statistical approach for hardware Trojan detection [C]// International Workshop on Cryptographic Hardware and Embedded Systems. Berlin : Springer, 2009: 396-410.
8 WANG S J, WEI J Y, HUANG S H, et al. Test gene-ration for combinational hardware Trojans [C]// Hardware-Oriented Security and Trust. [S.l.]: IEEE, 2016: 1-6.
9 XUE M, HU A, LI G. Detecting hardware Trojan through heuristic partition and activity driven test pattern generation [C]// Communications Security Conference. [S.l.]: IET, 2014: 1-6.
10 YE X, FENG J, GONG H, et al. An anti-Trojans design approach based on activation probability analysis [C]// Electron Devices and Solid-state Circuits. [S.l.]: IEEE, 2015: 443-446.
11 HAN C, WANG L, ZHANG Z, et al A multi-objective genetic algorithm based on fitting and interpolation[J]. IEEE Access, 2018, 6: 22920- 22929
doi: 10.1109/ACCESS.2018.2829262
12 MICHALEWICZ Z A non-standard genetic algorithm for the nonlinear transportation problem[J]. Informs Journal on Computing, 2017, 3 (4): 307- 316
13 LIN C T, PRASAD M, SAXENA A An improved polynomial neural network classifier using real-coded genetic algorithm[J]. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2017, 45 (11): 1389- 1401
14 MASMOUDI M A, BRAEKERS K, MASMOUDI M, et al A hybrid genetic algorithm for the heterogeneous dial-a-ride problem[J]. Computers and Operations Research, 2017, 81: 1- 13
15 FRIEDRICH T, K?TZING T, KREJCA M S, et al The compact genetic algorithm is efficient under extreme Gaussian noise[J]. IEEE Transactions on Evolutionary Computation, 2017, 21 (3): 477- 490
[1] 王晓晗,王韬,张阳,刘广凯. 改进边界Fisher分析近邻选择的硬件木马检测[J]. 浙江大学学报(工学版), 2020, 54(1): 152-159.
[2] 罗友强, 刘胜利, 颜猛, 武东英. 基于通信行为分析的DNS隧道木马检测方法[J]. 浙江大学学报(工学版), 2017, 51(9): 1780-1787.