Oligomorphic code
Oligomorphic code, also known as semi-polymorphic code, is a method used by a computer virus to obfuscate its decryptor by generating different versions of it, in order to evade detection by antivirus software. It is similar to, but less sophisticated than, polymorphic code.[1]
Oligomorphic code works by randomly selecting each piece of the decryptor from several predefined alternatives. At run time, these components can be combined in various ways to create new, distinct versions of the decryptor.[2]
Having multiple possible decryptors makes it more difficult for a virus to be detected with anti-malware signatures. However, most oligomorphic viruses are only able to generate a limited amount of decryptors,[2] around a few hundred[citation needed], so detecting them with simple signatures is still possible. Another method to detect an oligomorphic decryptor is to make a signature for each possible piece of code, group pieces that can substitute each other together and scan the file for a chain of decryptor pieces from alternating groups. Emulation may be used to detect the virus, but it can take more resources than necessary.[citation needed]
History
The first known virus using oligomorphic code was the Whale DOS virus, identified in 1990, which chose from a few dozen distinct decryptors. The first Windows 95 virus using oligomorphic code was the Memorial virus, which could generate 96 distinct decryptor patterns. Another example is the Russian virus family WordSwap.[1]
See also
- Timeline of notable computer viruses and worms
- Metamorphic code
- Self-modifying code
- Alphanumeric shellcode
- Shellcode
- Software cracking
- Security cracking
- Obfuscated code
References
- ↑ 1.0 1.1 Szor, Peter (2005). The Art of Computer Virus Research and Defense. Addison-Wesley. ISBN 9780321304544. https://books.google.com/books?id=rahQAAAAMAAJ. Retrieved 27 March 2023.
- ↑ 2.0 2.1 Blunden, Bill (4 May 2009). The Rootkit Arsenal: Escape and Evasion. Jones & Bartlett Learning, LLC. p. 570. ISBN 9780763782849. https://books.google.com/books?id=ifQPC86G66sC. Retrieved 27 March 2023.
 |  |
