Metamorphism, Formal Grammars And Undecidable Code Mutation release_fz3k3gafk5eqnidtq5wyk65yw4

by Eric Filiol

Published by Zenodo.

2007  

Abstract

This paper presents a formalisation of the different existing code mutation techniques (polymorphism and metamorphism) by means of formal grammars. While very few theoretical results are known about the detection complexity of viral mutation techniques, we exhaustively address this critical issue by considering the Chomsky classification of formal grammars. This enables us to determine which family of code mutation techniques are likely to be detected or on the contrary are bound to remain undetected. As an illustration we then present, on a formal basis, a proof-of-concept metamorphic mutation engine denoted PB MOT, whose detection has been proven to be undecidable.
In text/plain format

Archived Files and Locations

application/pdf  416.9 kB
file_7mx35nyftbhpdedzzykbevjrsy
zenodo.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2007-03-01
Language   en ?
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 949b71a9-0c67-40aa-919e-64fbd6247c5c
API URL: JSON