计算机应用研究Issue(2)：485-488,4.DOI:10.3969/j.issn.1001-3695.2015.02.036
基于同余方程和中国剩余定理的混淆算法
Obfuscation algorithms based on congruence equation and Chinese remainder theorem
摘要
Abstract
Based on introduction of the code obfuscation technology and Chinese remainder theorem,this paper used the key and the state for a group of congruence equations’solution to construct a parametric opaque predicate,and used Chinese re-mainder theorem of polynomial ring to judge opaque predicates’output.Theoretical analysis shows that the opaque predicate composed of several polynomials,is sensitive to the key,unidirectional,random and has higher concealment,the security of password is high,can resist static and dynamic attack.Experimental tests show that the change increases the complexity of the program after confusion,ensure the correctness and not to bring too much overhead of space and time.关键词
代码混淆/谓词/同余方程/多项式/中国剩余定理Key words
code obfuscation/predicate/congruence equation/multinomial/Chinese remainder theorem分类
信息技术与安全科学引用本文复制引用
陈代梅,范希辉,朱静,汪玉美..基于同余方程和中国剩余定理的混淆算法[J].计算机应用研究,2015,(2):485-488,4.基金项目
国家自然科学基金资助项目 （）
