子程序垃圾代码模糊变换的逻辑不变性研究

Guo-zi Sun, Baobing Wang, Dan-wei Chen, Qiang Cai
{"title":"子程序垃圾代码模糊变换的逻辑不变性研究","authors":"Guo-zi Sun, Baobing Wang, Dan-wei Chen, Qiang Cai","doi":"10.1109/NSWCTC.2009.204","DOIUrl":null,"url":null,"abstract":"Junk code fuzzy transformation (JCFT) is one of the effective approaches of the code obfuscation technology. Based on the analysis of current junk code strategies, this paper presents a new method named junk code encryption algorithm of subroutine, and depicts the algorithm with formalized language. The paper studies how to prove the logic invariability of subroutine’s JCFT with formalized method. After studying the formalized definition of subroutine’s JCFT, some lemmas are extracted. With these lemmas, and from three aspects such as \"XOR and CMP Expansion\", \"False Embranchment Construction\" and \"JNE Append Junk Code\", the paper proves that the procedure which transforms with subroutine’s JCFT has the same logicality with the original procedure.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"455 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Study the Logic Invariability in Subroutine's Junk Code Fuzzy Transformation\",\"authors\":\"Guo-zi Sun, Baobing Wang, Dan-wei Chen, Qiang Cai\",\"doi\":\"10.1109/NSWCTC.2009.204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Junk code fuzzy transformation (JCFT) is one of the effective approaches of the code obfuscation technology. Based on the analysis of current junk code strategies, this paper presents a new method named junk code encryption algorithm of subroutine, and depicts the algorithm with formalized language. The paper studies how to prove the logic invariability of subroutine’s JCFT with formalized method. After studying the formalized definition of subroutine’s JCFT, some lemmas are extracted. With these lemmas, and from three aspects such as \\\"XOR and CMP Expansion\\\", \\\"False Embranchment Construction\\\" and \\\"JNE Append Junk Code\\\", the paper proves that the procedure which transforms with subroutine’s JCFT has the same logicality with the original procedure.\",\"PeriodicalId\":433291,\"journal\":{\"name\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"volume\":\"455 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NSWCTC.2009.204\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSWCTC.2009.204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

垃圾代码模糊变换(JCFT)是一种有效的代码混淆技术。在分析现有垃圾码加密策略的基础上,提出了一种新的垃圾码加密子程序算法,并用形式化语言描述了该算法。本文研究了如何用形式化的方法证明子程序的jft的逻辑不变性。在研究了子程序JCFT的形式化定义后,提取了一些引理。利用这些引理,从“异或与CMP展开”、“假分支构造”和“JNE附加垃圾代码”三个方面证明了用子程序的JCFT变换后的程序与原程序具有相同的逻辑性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Study the Logic Invariability in Subroutine's Junk Code Fuzzy Transformation
Junk code fuzzy transformation (JCFT) is one of the effective approaches of the code obfuscation technology. Based on the analysis of current junk code strategies, this paper presents a new method named junk code encryption algorithm of subroutine, and depicts the algorithm with formalized language. The paper studies how to prove the logic invariability of subroutine’s JCFT with formalized method. After studying the formalized definition of subroutine’s JCFT, some lemmas are extracted. With these lemmas, and from three aspects such as "XOR and CMP Expansion", "False Embranchment Construction" and "JNE Append Junk Code", the paper proves that the procedure which transforms with subroutine’s JCFT has the same logicality with the original procedure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信