首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于二进制熵的加解密函数定位方法
引用本文:焦龙龙,罗森林,丁庸,潘丽敏,张笈.基于二进制熵的加解密函数定位方法[J].北京理工大学学报,2018,38(11):1163-1167.
作者姓名:焦龙龙  罗森林  丁庸  潘丽敏  张笈
作者单位:北京理工大学信息与电子学院,北京,100081;北京理工大学信息与电子学院,北京,100081;北京理工大学信息与电子学院,北京,100081;北京理工大学信息与电子学院,北京,100081;北京理工大学信息与电子学院,北京,100081
摘    要:针对二进制程序模糊测试中加解密函数定位准确率低的问题,提出一种基于二进制熵的加解密函数定位方法.该方法对二进制程序的控制流信息进行模型构建以定位程序关键代码,提取关键代码前后的数据流并计算其二进制熵,通过前后二进制熵的关系确定被测代码中是否存在加解密函数.实验结果表明,该方法能够有效发现程序中的加解密函数,准确率大于99%;该方法可以用于提高模糊测试发现漏洞的能力,具有一定的实用价值. 

关 键 词:二进制熵  加解密函数定位  模糊测试  二进制程序
收稿时间:2017/6/4 0:00:00

Cryptographic Function Location Based on Binary Entropy
JIAO Long-long,LUO Sen-lin,DING Yong,PAN Li-min and ZHANG Ji.Cryptographic Function Location Based on Binary Entropy[J].Journal of Beijing Institute of Technology(Natural Science Edition),2018,38(11):1163-1167.
Authors:JIAO Long-long  LUO Sen-lin  DING Yong  PAN Li-min and ZHANG Ji
Institution:School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China
Abstract:To solve the accurate problem of cryptographic function location for fuzz testing of binary program, a location method based on binary entropy was proposed. Firstly, instruction features of binary program were modeled to locate key code. Then binary entropy of data handled before and after key code was calculated. Finally, the cryptographic function was located according to binary entropy relationship before and after key code. Experimental results show that this method can locate cryptographic functions in binary program effectively and the accurate rate is more than 99%. This method can enhance the ability of fuzz testing.
Keywords:binary entropy  cryptographic function location  fuzz testing  binary program
本文献已被 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号