作者: Jean-Marie Borello , Ludovic Mé
DOI: 10.1007/S11416-008-0084-2
关键词:
摘要: This paper deals with metamorphic viruses. More precisely, it examines the use of advanced code obfuscation techniques respect to Our objective is evaluate difficulty a reliable static detection viruses that such techniques. Here we extend Spinellis’ result (IEEE Trans. Inform. Theory, 49(1), 280–284, 2003) on complexity bounded-length polymorphic In particular, prove particular category an \({\mathcal{NP}}\)-complete problem. Then empirically illustrate our by constructing practical obfuscator which could be used in future evade detection.