{"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}
引用次数: 1
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.