POLYMORPHIC VIRUS DETECTION MODULE

Abstract: A Polymorphic Anti-virus Module (PAM) (200) comprises a CPU emulator (210) for emulating the target program, a virus signature scanning module (250) for scanning decrypted virus code, and an emulation control module (220), including a static exclusion module (230), a dynamic exclusion module (240), instruction/interrupt usage profiles (224) for the mutation engines (162) of the known polymorphic viruses (150), size and target file types (226) for these viruses, and a table (228) having an entry for each known polymorphic virus (150). Prior to emulation, the static exclusion module (230) examines the gross characteristics of the target file for attributes that are inconsistent with the size/type data (226), and excludes polymorphic viruses (150) from the list (228) accordingly. During emulation, the dynamic exclusion module (240) compares fetched instructions with the instruction/interrupt usage profiles (224) to determine when emulation has proceeded to a point where at least some code from the decrypted static virus body (160) may be scanned for virus signatures.

Description: POLYMORPHIC VIRUS DETECTION MODULE Background of the Invention Technical Field This invention relates to the field of computer viruses, and in particular to methods and systems for detecting polymorphic viruses. Background Art Polymoφhic viruses are a type of computer virus designed to evade detection by infecting each new file with a mutated version of the virus. By providing each newly infected file with viral code having a different appearance, polymoφhic viruses frustrate most standard virus-detection schemes, which rely on some type of string scanning to identify computer viruses in a file. Polymoφhic viruses comprise a static virus body and a mutation engine. In the most common polymoφhic viruses, the virus does not mutate. Rather, the mutation engine generates a virus decryption routine (polymoφhic decryption loop) and uses the dual of this routine to encrypt the static virus body and the mutation engine. The new decryption routine and the newly encrypted virus body are then inserted into the host file. Common mutation strategies employed by the mutation engine include reordering of instructions, substituting equivalent instructions or equivalent sequences of instructions, inserting random "garbage" instructions (which have no effect on the virus functionality), interchanging function calls, in-line code, JMP instructions, and the like, and using equivalent registers interchangeably. Thus far, the most successful technique for detecting polymoφhic viruses has been cue- directed program emulation (CDPE). CDPE methods assumes that the polymoφhic code contains at least one section of machine code, the static viral body, that is consistent from generation to generation. CDPE methods also assume that when executed the decryption routine of the polymoφhic virus deterministically decrypts the encrypted static virus body and transfers control to the static virus body when decryption is complete. The strategy employed by CDPE methods is to emulate the polymoφhic virus until it has decrypted itself and then analyze the decrypted virus body using standard scanning techniques. CDPE virus detection systems comprise a scanner module, a CPU emulator (80x86), a set of virus signatures, and an emulation control module. The scanner module locates a file's entry point and the CPU emulator performs a limited emulation of the file's machine code under control of the emulation control module. Emulation proceeds until the emulation control module believes either that the virus is fully decrypted or that the file is not infected with a virus, at which point string scanning for virus signatures commences. The CDPE emulation control module examines each emulated instruction with the aid of certain heuristics to determine whether the instructions being emulated are likely to be part of a polymoφhic decryption loop or a normal program. For example, certain sequences of instructions are frequently found in polymoφhic decryption loops. These instruction sequences are referred to as "boosters" since they indicate to the emulation control module that it is seeing a potential decryption loop and should continue emulating instructions. Other sequences of instructions are rarely found in decryption loops. These instruction sequences are referred to as "stoppers" since they indicate to the emulation control module that the instructions are probably not from a virus decryption loop. Stoppers may be present if the host file is not infected or if the emulation has fully decrypted the static virus body. In the latter case, the static virus body, like any other program, may use any instructions supported by the processor architecture. In addition, stoppers may be present if a virus designer has included them in a decryption loop to foil CDPE detection methods. CDPE based methods employ additional heuristics to determine what the detection of various stoppers and boosters indicates about the code being emulated. For example, if a number of stoppers have been found prior to the detection of any boosters, the emulation control module will likely decide that the host file is uninfected. On the other hand, if one or more stoppers are detected following detection of a number of boosters, the emulation control module will likely decide that the polymoφhic loop has been fully decrypted to reveal the static virus body. In this case, virus scanning will proceed. The selection of boosters and stoppers included in the emulation control module can have a substantial impact on the speed and accuracy with which the CDPE system detects viruses. Ideally, stoppers and boosters are selected to work accurately for all known polymoφhic viruses. However, it may not be possible to find a set of such heuristics that does not significantly slow virus scanning. Stoppers and boosters useful for detecting several polymoφhic viruses may actually prevent the detection of other polymoφhic viruses, as for example, where a virus writer includes a standard stopper in polymoφhic loop code to confuse CDPE modules. In general, any change in the stoppers or boosters used must be accompanied by extensive regression testing to insure that previously detected viruses are not missed using the new heuristics. Since new polymoφhic viruses are continually being developed, the time consuming and awkward selection and regression testing of new combinations of stoppers and boosters can not be avoided. Thus, there is a need for polymoφhic virus detection systems that can be readily expanded to cover newly discovered viruses, without need for extensive regression testing and modification of the heuristics of the emulation control module. In addition, the system should be able to provide accurate results without emulating unnecessarily large numbers of instructions. Summary of the Invention The present invention is a polymoφhic anti-virus module or PAM (200) for detecting polymoφhic viruses ( 150) using mutation-engine specific information for each known polymoφhic virus rather than heuristic stopper and booster code sequences. The PAM system (200) comprises a CPU emulator (210) for emulating the target program, a virus signature scanning module (250) for scanning decrypted virus code, and an emulation control module (220), including a static exclusion module (230) and a dynamic exclusion module (240), for determining how long each target file is emulated before it is scanned. The emulation control module (220) also includes data (222) specific to each known polymoφhic virus (150) and organized in a format that facilitates comparison with target files being tested for infection. This data (222) includes instruction interrupt usage profiles (224) for the mutation engines (162) of the known polymoφhic viruses (150), as well as size and target file types (226) for these viruses. The emulation control module (220) also includes a table (228) having an entry for each known polymoφhic virus (150) which can be flagged when characteristics inconsistent with the polymoφhic virus are detected. In accordance with the present invention, the static exclusion module (230) examines the gross characteristics of the target file for attributes that are inconsistent with the mutation engine specific data for known polymoφhic viruses (150). These characteristics are the type of target file, the size of the target file's load image, the presence of certain instructions at the file entry point, and the distance between the file entry point and the end of the load image. The last characteristic is useful because most viruses append themselves to the files they infect. In some cases, the static exclusion module (230) allows certain target files to be identified as infected without any emulation. The dynamic exclusion module (240) examines the instruction/interrupt usage profiles (224) of each known polymoφhic virus (150) as each instruction is fetched for emulation. The instruction/interrupt usage profiles (224) indicate which polymoφhic viruses (150) employ mutation engines that do not use the fetched instruction in decryption loops they generate, and the emulation control module (220) flags these viruses. The emulation control module (220) continues until all mutation engines have been flagged or until a threshold number of instructions have been emulated. The flagging technique implemented by the dynamic exclusion module (240) determines when emulation has proceeded to a point where at least some code from the decrypted static virus body (160) may be scanned and substantially reduces the number of instructions emulated prior to scanning the remaining target files without resort to booster or stopper heuristics. It is not always necessary to fully decrypt the static virus body (160) to identify the underlying virus. In the preferred embodiment of the invention, the emulation control module (220) tracks those parts of virtual memory modified during emulation and periodically interrupts the emulation process to call the scanning module (250). The scanning module (250) tries to identify the virus type from the portion of decrypted static virus code ( 160). In order to speed up the process, the scanning module (250) implements a coarse scan of tagged memory locations to identify data bytes most likely to be associated with decrypted static virus code (virus signatures). It implements a more detailed binary search process only when selected bytes are encountered during the coarse scan. This approach greatly speeds up scanning without decreasing the accuracy of the scanning module (250). When code matching one of the viral signatures is identified, the PAM system (200) signals to the host computer that an infected file has been located. Brief Description of the Drawings Figs. 1 A-l C are schematic representations of the load images of an uninfected computer file, a file infected by a virus, and a file infected by a polymoφhic virus, respectively. Fig. 2 is a block diagram of a Polymoφhic Anti-virus Module (PAM) in accordance with the present invention. Fig. 3 is an example of an instruction interrupt usage profile employed in the emulation control module (220) of the present invention. Fig. 4A is a flowchart of the emulation process implemented by an emulation control module (220) in accordance with the present invention. Fig 4B is a flowchart of the scanning process implemented by a scanning module (250) in accordance with the present invention. Detailed Description of the Preferred Embodiments Computer viruses infect a variety of files in a number of different ways. In the DOS environment, computer viruses have been used to infect three different types of executable files: COM files, SYS files, and EXE files. A common feature of these files is that at some point after loading, control of the computer is passed to the program code stored in the file. Computer viruses infect these executable files by attaching themselves to the file and modifying the machine language at the file entry point to transfer control to the virus rather than to the executable file. In order to camouflage their presence, computer viruses typically return control to the infected executable file once they have run. Referring to Figs. 1 A and IB, there are shown executable images 100, 100' of an EXE file before and after infection, respectively, by a virus 130. Infection modes for EXE, COM, and SYS files are discussed in greater detail in Nachenberg, A New Technique For Detecting Polymorphic Computer Viruses, Master Thesis, University of California at Los Angeles (1995), which is hereby incoφorated by reference. Executable image 100 comprises a header 1 10 and program code 120. Header 110 includes a signature (MZ), size field, a code segment field CS, an instruction pointer field IP, a stack segment field SS, and a stack pointer field SP. MZ indicates the file type (EXE in this case) and the following field specifies the size of executable image 100. CS and IP specify an entry point 122 of program code 120, and SS and SP point to the end of program code 120, where a stack (not shown) may be generated. Upon infection by computer virus 130, header 1 10' of executable image 100' is modified so that size field equals the size of executable image 100 incremented by the size of computer virus 130. In addition, computer virus 130 has replaced CS, IP of image 100 with CS', IP' in image 100'. CS', IP point to an entry point 132 of virus 130 rather than entry point 122 of program code 120. Similarly, computer virus 130 has replaced SS, SP of image 100 with SS', SP' in image 100', which point to the end of virus 130. In order to return control of the computer to program code 120 following execution of virus 130, CS, IP, SS, and SP of uninfected image 100 are retained by virus 130. Computer viruses 130 which are added to EXE, COM, or SYS files in the manner of Fig. IB are relatively easy to detect. A virus detection program need only scan executable image 100' for code segments associated with known viruses 130. These code segments, known as virus signatures, are code segments unique to different viruses, and their presence in an executable image 100' is taken as a clear indication that the corresponding file has been infected. A number of methods are available for scanning executable images 100' for virus signatures. Different viruses 130 may implement a number of strategies to hide their presence in an executable image 100'. One of the most successful strategies is that implemented by polymoφhic viruses, which include a mutation engine that encrypts a static virus body according to a different (mutated) encryption key with each new infection. The encrypted virus is appended to the image with a mutated decryption routine, which decrypts the encrypted virus to reveal the static virus body only when the file is executed. The new appearance presented by such polymoφhic viruses on each infection frustrate those detection methods which would simply scan images 100' for viral signatures. Referring now to Fig. IC, there is shown an executable image 100" infected by a polymoφhic virus 150. Polymoφhic virus 150 comprises a static virus body 160 including a mutation engine 162, both of which are shown hatched in the Fig. IC to indicate their encrypted state. On infection, mutation engine 162 generates a variable encryption routine (not shown) that encrypts static virus body 160 (including mutation engine 162) to prevent detection of polymoφhic virus 150 by conventional scanning techniques. A decryption routine 164, which is die dual of the encryption routine, is prepended to encrypted static virus body 160. When image 100" is executed, a decryption routine 164 decrypts and passes control to static virus body 160, which employs the CPU of the host computer to attach itself to other files and implement whatever mischief its designer intends. One anti-virus detection scheme designed specifically for polymoφhic viruses 150 is Cue Directed Program Emulation (CDPE). CDPE operates by emulating a target image 100" or file for a sufficient number of instructions to allow a polymoφhic virus 150 present in image 100" to decrypt itself and reveal its static virus body 160. Static virus body 160 is then scanned to identify the type of virus present and steps are taken to deactivate it. As noted above, CDPE methods rely on the detection of prescribed stopper and booster code segments as a target file is emulated in order to determine whether an encrypted static virus body 160' is present, and if so, to determine whether it has been at least partially decrypted. The problem with this approach is that stopper and booster segments must be selected carefully and thoroughly tested in order to detect viruses accurately and completely. Stoppers and boosters added to detect new viruses require thorough regression testing to insure that they do not interfere with the detection of other polymoφhic viruses. In short, stoppers and boosters that will work effectively with all polymoφhic viruses must be identified, even as virus designers use these same stopper and booster heuristics to better camouflage their creations. In addition to the problems posed by any changes in the stopper, booster heuristics, CDPE emulation is done by virtual machines in order to isolate potentially infected files from the actual CPU and memory of the host computer. These virtual machines tend to operate slowly relative to the actual CPUs, and since each file must be checked, virus checking can be a very time consuming process. The speed of these programs is slowed further as more complicated heuristics are developed to detect polymoφhic viruses. Referring now to Fig. 2, there is shown a block diagram of a polymoφhic anti-virus module (PAM) 200 in accordance with the present invention. PAM 200 comprises an emulation module 210, an emulation control module 220, and a scanning module 250. As in CDPE systems, emulation module 210 allows PAM 200 to emulate a target file without allowing the target file to interact with either the actual CPU or memory of the host computer. Scanning module 250 includes virus signatures 252 for identifying polymoφhic viruses 150 and a scanning engine 254 for efficiently searching decrypted virus code for these signatures. The scanning engine 254 is discussed in greater detail below in conjunction with Fig. 4B. Emulation control module 220 comprises virus profile data 222, a static exclusion module 230, and a dynamic exclusion module 240, which combine to substantially reduce the number of file instructions that must be emulated in order to determine whether a target file is infected by a virus. Virus profile data 222 comprises an instruction/interrupt usage profile 224 for each known polymoφhic virus 150 as well as data on the sizes of known polymoφhic viruses 150 and type of target files infected by each (size/type data 226). Size/Type data 226 is accessed by static exclusion module 230 prior to emulation to eliminate certain polymoφhic viruses 150 from consideration, and instruction/interrupt usage profiles 224 are accessed by dynamic exclusion module 240 during emulation to determine whether the emulated code may be part of a virus decryption loop. Emulation control module 220 also includes a table 228 of all known polymoφhic viruses 150 which is initialized with all viruses 150 flagged. As each virus 150 is eliminated from consideration by static or dynamic exclusion modules 230, 240, respectively, the corresponding flags are reset to preclude further consideration of the virus. For example, gross features of executable image 100 that are inconsistent with various polymoφhic viruses 150 allow the static exclusion module 230 to rule out infection of a target file 100 by these polymoφhic viruses before any emulation is done. If features inconsistent with a polymoφhic virus 150 are detected in target file 100, the associated flag in table 228 is reset and it is excluded from further consideration during the subsequent emulation phase. If the gross features of target file 100 are inconsistent with infection by all known polymoφhic virus 150, no emulation is required to determine that target file 100 is uninfected, and the next target file may be considered. More often, analysis by static exclusion module 230 allows only some of polymoφhic viruses 150 to be excluded from further consideration. Data on polymoφhic viruses 150 considered by static exclusion module 230 are: (1) the type of target file each known polymoφhic virus 150 is designed to attack; (2) the minimum size of the load image of each polymoφhic virus 150; (3) whether a polymoφhic virus 150 uses a JMP instruction as the first instruction of in target COM file; and (4) the maximum size of the load image of each polymoφhic virus 150. In order to take advantage of this data, static exclusion module 230 determines: the target file type and load image size for a target file being analyzed. In addition, if a COM target file is being analyzed, static exclusion module 230 determines its first instruction, and if an EXE target file is being analyzed, static exclusion module 230 determines the distance between the entry point and end of the load image. Theses gross characteristics and their relationship to features of known polymoφhic viruses 150 are considered below. Type of Executable File Targeted Different viruses infect different executable file formats. Some infect only COM files, some infect only EXE files, and some infect both COM and EXE files. Very few viruses infect SYS files but some of these can infect EXE or COM files as well. Consequently, if target file is an EXE file, all polymoφhic viruses 150 that attack only COM files or SYS files may be excluded from further consideration in the analysis of target file 100. In this case, flags are reset in table 228 for each of polymoφhic viruses 150 excluded by the type of target file 100, and subsequent analysis of target file 100 considers only unexcluded polymoφhic viruses 150. Minimum Size of Polymoφhic Virus Depending on the encryption routine employed, polymoφhic viruses 150 may generate executable images having a range of sizes. However, a minimum size for the executable image of each polymoφhic virus 150 is provided by unencrypted static virus body 160 , including mutation engine 162. Consequently, each polymoφhic virus 150 having an executable image that is larger than the executable image 100 of the target file being analyzed may be excluded from further consideration in that analysis. JMP Instruction Usage Many polymoφhic viruses 150 that infect COM files do so by appending themselves to the COM file and inserting a JMP instruction at the entry point of the COM file. Consequently, when static exclusion module 230 examines a COM file and determines that the first instruction is not a JMP instruction, each polymoφhic virus 150 that employs such an instruction at the entry point of infected COM files may be excluded from further consideration. Entry Point Distance in EXE Files Polymoφhic viruses 150 that infect EXE files have a maximum load image size. Since these viruses infect EXE files by appending themselves to the EXE file load image, the distance between entry point 132 and the end of the load image must be less than this maximum value. Any polymoφhic viruses 150 having maximum sizes less than the distance calculated for an EXE file under analysis may be excluded from further consideration. This list of features examined during the static exclusion phase is not intended to be exhaustive. Additional features of polymoφhic viruses 150 may also be suitable for use by static exclusion module 230 to exclude various polymoφhic viruses 150 from further consideration. Typically, only a subset of known polymoφhic viruses will be ruled out by static exclusion module 230 and some emulation will be required. In these cases, dynamic exclusion module 240 is implemented to initiate and control emulation module 210. During emulation, emulation control module 220 instructs emulation module 210 to fetch an instruction from load image 100. As each instruction is fetched, emulation control module 220 compares the fetched instructions with an instruction interrupt usage profile 224 for each known polymoφhic virus 150. For each polymoφhic virus 150 that does not implement the fetched instruction as indicated by its instruction/interrupt usage profile 224, the corresponding flag in table 228 is reset to exclude the polymoφhic virus from further consideration. This process continues with each succeeding instruction until all polymoφhic viruses 150 have been excluded. Alternatively, the emulation phase for a target file may be stopped or suspended when one of two other conditions occurs. These conditions are discussed in greater detail below, in conjunction with Fig. 4A. Referring now to Fig. 3, there is shown an example of an instruction/interrupt usage profile 224 employed by emulation control module 220 to detect a corresponding polymoφhic virus 150. Instruction/interrupt usage profiles 224 are made possible by the fact that mutation engines 162 of known polymoφhic viruses 150 do not use the entire instruction set available for various processor architectures. For example, the 80x86 instruction set allows for variable length instructions. However, in most cases the first byte of each instruction determines its basic functionality, providing 256 possible basic instruction types. Mutation engines 162 typically employ substantially fewer than 256 instruction types of the 80x86 instruction set. Referring still to Fig. 3, each bit of instruction/interrupt usage profile 224 corresponds to a different possible instruction type supported by the 80x86 architecture. A 1 indicates that mutation engine 152 of polymoφhic virus 150 uses the corresponding instruction in its decryptors, and a 0 indicates that the instruction is not used by mutation engine 152. For example, the mutation engine employed by the Everfire polymoφhic virus uses eight different instruction types in its decryptors, while the DSCE mutation engines uses 190 different instruction types in its decryptors. Consequently, instruction usage profile 224 for the Everfire polymoφhic virus includes only eight ones in the bits corresponding to these instructions. On the other hand, 190 of 256 bits of instruction usage profile 224 fro the DSCE polymoφhic virus are ones, making this virus more difficult to detect. The instructions/interrupts used by the mutation engine of a polymoφhic virus may be determined by infecting a large number of files with the polymoφhic virus and analyzing the decryption loops generated in the infected files. Virus infection may be done automatically under software control, and the resulting polymoφhic decryption loops may likewise be analyzed automatically to generate instruction interrupt usage profile 224 appropriate for the virus' mutation engine. Further, since each polymoφhic virus 150 is tested with data specific to its mutation engine 162, there is no need for regression testing when a new instruction/interrupt usage profile is added to emulation control module 220. Polymoφhic viruses 150 typically have no reason to use interrupts in their decryption loops, and consequently, these were used as "stoppers" by CDPE anti-virus program developers. Not suφrisingly, virus developers began to include interrupts in their decryption loops specifically because conventional CDPE programs would inteφret their presence as an indication that the associated code was not part of a decryption loop. In the present invention, emulation control module 220 treats detection of an interrupt in a manner similar to detection of any instruction, to eliminate from further consideration each polymoφhic virus 150 that does not employ such an interrupt in its decryption loop. Emulation control module 220 compares the instructions/interrupts fetched by emulator module 210 with the corresponding entry in instruction interrupt usage profile 224 of each polymoφhic virus 150 still under active consideration. When emulator 210 fetches an instruction (or an interrupts) that is not employed by one of polymoφhic viruses 150 still being considered, the corresponding flag in table 228 is reset indicating that the virus should no longer be considered in the emulation phase of PAM 200. Typically, Emulation module 210 eventually retrieves an instruction that is not implemented by the last actively considered polymoφhic virus 150. This indicates either that (1) target file 100 in not infected with any of polymoφhic viruses 150 or (2) one of polymoφhic viruses 150 has been decrypted to reveal static virus body 160, which like any program can employ any of the instructions supported by the CPU architecture. Most mutation engines 162 can be eliminated from consideration on one pass through the decryption loop of polymoφhic virus 150. However, in order to eliminate the possibility of getting trapped in an infinite loop or spending too much time in the emulation phase, an upper limit may be set for the number of instructions to be emulated. In the preferred embodiment of the invention, emulation control module 220 terminates the emulation phase when either all polymoφhic viruses 150 have been excluded or 1.5 million instructions have been executed. Once the emulation phase has been terminated, scanning can begin on decrypted static virus body 160 or at least those parts decrypted by the first 1.5 million instructions. In order to facilitate scanning of static virus body 160, emulation control module 220 keeps track of which locations of virtual memory are most likely to be infected. In particular, emulation control module 220 tags the page or pages of virtual memory containing an instruction executed by emulator 210. In addition, every time an emulated instruction writes to memory, the altered pages are tagged as containing modified data. Tagged pages in virtual memory are scanned for signatures of static virus body 160 as follows: (1) if a page contains executed code, it and the following page are scanned (2) if a page has been written to during emulation and more than a threshold number of memory writes occurred anywhere in memory during emulation, the modified page and the following page are scanned. In the preferred embodiment of the invention, a threshold number of memory writes equal to 32 bytes has been found to speed up scanning without sacrificing accuracy. However, the 32 byte value is a heuristic and may be adjusted up or down as desired. All existing polymoφhic viruses 150 modify far more than 32 bytes when they decrypt themselves. On the other hand, the number of data bytes modified by an uninfected program is typically fewer than the number modified by a polymoφhic virus 150. If fewer than 32 bytes have been modified by the time the emulation phase of PAM has concluded, emulation control module 220 assumes that nothing was decrypted and does not scan modified pages. At the completion of emulation phase, PAM 200 proceeds to a scanning phase in which all pages from which instructions were retrieved during emulation are scanned, and all pages modified during emulation are scanned provided at least 32 bytes of virtual memory have been modified during the emulation phase. During the scanning phase, virus signatures for each known polymoφhic virus 150 are compared with executed and modified code in the virtual memory locations identified above. PAM 200 may employ a scanning module 250 that implements any of a number of scanning methods to search the tagged memory locations. However, in the preferred embodiment of PAM 200, scanning module 250 implements a scanning process that allows each target buffer to be scanned for signatures of all known polymoφhic viruses 150 in a single pass. As used here, a target buffer corresponds to a tagged page of virtual memory. The preferred scanning process requires that all virus signatures comply with two conditions: (1) Virus signatures are chosen to begin with one of a selected number of special bytes. In the preferred embodiment, sixteen special bytes are selected. (2) Virus signatures are chosen such that emulation of corresponding polymoφhic virus 150 will not modify bytes of the signature. The first rule limits the number of valid virus signatures, but it speeds up the scanning rate of scanning module 250, which simply skips any data not beginning with the selected bytes. Scanning module 250 performs a more elaborate scan when data beginning with one of the selected bytes is encountered. In the preferred embodiment, the selected bytes are: 2E, 3D, 50, 74, 8B, 8C, B8, B9, BA, BB, BE, BF, CD, E8, E9, These bytes are selected based on their frequent use in 80x86 machine code. The set of selected bytes is not fixed in either number or content and may be adjusted as necessary. However, use of additional selected bytes will slow the scanning phase. For each selected byte, scanning module 250 includes a pre-computed bit array which determines whether the selected bit is part of a virus signature. When scanning module 250 encounters one of the selected bytes, the top thirteen bits of the next word provide an index into the bit array associated with the selected byte. The associated bit arrays are designed so that the indexed bit is a zero when scanning engine 250 includes no virus signature that matches the first three bytes of the target data and a one when scanning engine includes a virus signature that matches at least these three bytes. In the first case, scanning engine 250 proceeds to the next data having one of the selected bytes. When the indexed bit is a one, scanning module 250 contains a signature matching at least the first three bytes of the data under consideration and proceeds with a binary search to determine whether the target bytes match one of its virus signatures. Thus, a full binary search is performed on only a small subset of potential target bytes. When the binary search matches these target bytes to a virus signature, scanning engine 250 terminates scanning of the target file, and PAM 200 indicates the identity of the detected polymoφhic virus to a program designed to deactivate the virus. Deactivation programs are well known and are not discussed in greater detail here. Referring now to Fig. 4A, there is shown a flow chart of static and dynamic exclusion phases of a polymoφhic virus detection method 400 implemented by PAM 200. Method 400 begins by initializing 410 a virtual machine for emulating files in isolation from the host computer and loading 414 a target file for analysis. Analysis of the target file begins with a static exclusion phase, in which the target file is examined 418 for features that exclude certain known viruses from further consideration (static exclusions). If all known viruses have been excluded 420 at step 418, the target file is deemed infection-free 440 and the next target file is loaded 414 for emulation. If all known viruses are not excluded 420, method 400 enters the emulation phase. During the emulation phase, instructions are fetched 424 from the target file and compared 428 with instruction interrupt usage profiles 224 of known polymoφhic viruses 150. For each polymoφhic virus 150 that does not implement the fetched instruction, a corresponding flag in table 228 is reset. The fetched instruction is then emulated 430 and any pages in virtual memory affected by the instruction are tagged 434. Affected pages include pages of virtual memory from which the instruction is fetched 424 as well as any pages in virtual memory that are modified when the instruction is emulated 430. Following emulation 430 and tagging 434, method 400 determines 438 whether emulation should proceed or branch to the scanning phase. In the disclosed embodiment of the invention, the scanning phase is entered if flags have been reset for all polymoφhic viruses 150 in table 228 or if a preselected number of instructions have been emulated. In addition, the scanning phase may be entered periodically, prior to the occurrence of either of these conditions, to attempt to identify a virus that has been partially decrypted. This periodic scanning approach is discussed below in conjunction with the scanning phase. If method 400 determines 438 that none of the above conditions for entering the scanning phase have occurred, the next instruction of the target file is fetched 424 for analysis. Eventually, either all polymoφhic viruses 150 have been flagged 428 or the preselected number of instructions have been emulated 430, and method 400 enters the scanning phase 450. In the preferred embodiment of the invention, the preselected number of instruction is 1.5 million. This allows emulation of sufficient instructions to decrypt a substantial part of static virus body 160, even if it is not fully decrypted. Referring now to Fig. 4B, there is shown a flow chart of the scanning phase of method 400. Page locations tagged 434 during the emulation phase are accessed 454 and scanned 458 byte at a time to determine 460 whether each scanned byte is a selected byte. If not, the next byte is scanned 458 and tested 460 until it is determined 462 that no more bytes remain on the current tagged page. When the last byte of the tagged page is reached 462, the next tagged page is accessed 454, and the process is repeated with each byte of the new tagged page. When a selected byte is identified 460, the corresponding bit array is retrieved 464 to determine 468 whether the selected byte and two following bytes of the word are consistent with any of the viral signatures. If no match is possible, scanning process 450 branches to step 462. If a match is possible 468, process 450 begins a binary scan 470 to determine whether the full word actually matches 474 a viral signature. If a match is detected 474, process 450 indicates that the file is infected and proceeds to load 488 the next file for analysis. At this point, another module may be activated to eliminate the detected virus from the infected file. If no match is detected 474, scanning continues with the first byte of the next tagged page, unless it is determined 478 that the scanned byte is the last byte the last tagged page. When scanning of all tagged pages is completed without a match, the next step depends on which condition at step 438 of the emulation phase initiated scanning process 450. If the just completed scan was one initiated periodically 480 during decryption in the emulation phase, process 450 returns control 482 to the emulation process 400 in order to continue decrypting the target file. On the other hand, if the emulation phase was terminated 438 by either exclusion of all known polymoφhic viruses 150 or emulation of 1.5 million instructions, no further emulation of the current target file is necessary. The target file is deemed uninfected 484 and the next target file is loaded 488 for analysis. In order to test PAM system 200, instruction interrupt profiles 224 were generated for the six mutation engines 162 (implemented in the indicated viruses) and twelve polymoφhic viruses 150 listed in Table 1. Each mutation engine 162/polymoφhic virus 150 was used to infect 200 files, and 100 of these infected files were executed, generating a sample of 100 different decryption loops for each mutation engine 162/polymoφhic virus 150. The sample of decryption loops were then scanned, and the instructions/interrupts used by each mutation engine 162/polymoφhic virus 150 were tallied to provide a corresponding instruction/interrupt profile 224 (Fig. 3). Instruction/interrupt profiles 224 generated by the 100 infected files were then employed by PAM 200 in scanning the remaining 100 infected files. PAM system 200 detected each mutation engine 162/polymoφhic virus 150 in each of the 100 infected files. Mutation Engine (& Viruses) Used) Polymorphic Virus Dark Angel Mutation Engine (DAME) Bishop Virus Virus used: Lame Dark Slayer Confusion Engine (DSCE) Commander Bomber Virus Virus used: Connie Dark Slayer Mutation Engine (DSME) Everfire Virus Virus used: Connie The Mutation Engine (MtE) IAMV Virus Viruses used: Coffeshop, CryptLab, Fear, Groove, Insuf, Pogue, Questo, Sara, Shocker SMEG K-Hate Virus Virus used: Queeg Trident Polymoφhic Engine (TPE) Mutagen Virus Viruses used: Bosnia, Giraffe, YB Natas Virus One-Half Virus Satan Bug Virus Tremor Virus Uruguay (10) Virus V2P6Z Virus Referring now to Table 2, there is shown a comparison of the detection statistics for PAM system 200 and four other shareware and commercial virus detection products. Each anti-virus program was run on the same 100 infected files examined by PAM system 200. A 'yes' entry for a virus indicates that the corresponding anti-virus program detected each of the instances of infection for the corresponding virus. Only an anti-virus scanner that detects all infections of a given virus can guarantee that a cleaned system will not become reinfected. As can be seen from the table, only the PAM system 200 detected every instance of every virus. Engine/Virus McAfee KAMI AVP 2.1 Command Thunderb te PAM SCAN 2.20 (CDPE-Based) F-Prot 2.17 TBAV 6.34 (CDPE-Based) (CDPE-Based) DAME no yes no yes yes DSME no yes yes yes yes MtE no yes yes yes yes Mutagen no yes yes yes yes SMEG no yes yes yes yes TPE 1.4 no yes no yes yes Cmdr. Bomber no yes no no yes Everfire no yes yes yes yes IAMV yes yes yes yes yes K-Hate no yes no no yes Natas yes yes yes yes yes One Half no yes no yes yes Bishop no no yes yes yes Satan Bug yes yes yes yes yes Tremor yes yes yes yes yes Uruguay (10) no no no no yes DSCE not tested not tested not tested not tested yes VsP6Z yes yes yes yes yes Thus, a system and method have been provided for detecting polymoφhic viruses without recourse to the booster and stopper heuristics employed by available CDPE-based systems. Systems and methods in accordance with the present invention employ a static phase in which the gross features of a file are first examined to determine whether infection by some polymoφhic viruses can be excluded at the outset. A subsequent emulation phase looks for a polymoφhic detection loop in the file by comparing each instruction generated during file emulation with instruction/interrupt usage profiles for known polymoφhic virus/mutation engine. Virtual memory pages executed or modified during emulation are tested during a scanning phase for virus signatures.

Claims: Claims 1. A computer implemented metiiod for detecting polymoφhic viruses in a computer file, the method comprising the steps of; fetching an instruction from the computer file; determining whether the instruction may be used in decryption loops generated by known polymoφhic viruses identified in a list; when the instruction is used in decryption loops generated by know polymoφhic viruses, tagging a memory location associated with the instruction and repeating the fetching and determining steps; and scanning the tagged locations for virus signatures when the emulated instruction is not used in decryption loops generated by known polymoφhic viruses. 2. The computer implemented method of claim 1 , wherein the determining step comprises the substeps of: comparing the instruction with instruction/interrupt usage profiles for known polymoφhic viruses identified on the list; excluding from the list known polymoφhic viruses having instruction/interrupt profiles that do not include the instruction; and identifying the instruction as used if it appears in the instruction/interrupt usage profile of non-excluded polymoφhic virus. 3. The computer implemented method of claim 2, wherein the identifying step comprises identifying the instruction as used if it appears in the instruction/interrupt usage profile of a non- excluded polymoφhic virus or if a threshold number of instructions have been fetched. 4. The computer implemented method of claim 1 , wherein the tagging step comprises the substeps of: emulating the instruction; tagging a page in memory from which the emulated instruction is fetched; and tagging a page in memory including data modified by the emulated instruction. 5. The computer implemented method of claim 1 , comprising the additional steps of: prior to the fetching step, determining size and type features of the computer file; and excluding from the known polymoφhic viruses identified on the list, those known polymoφhic viruses having characteristics inconsistent with the size and type features of the computer file. 6. The computer implemented method of claim 5, wherein the step of determining size and type features of the computer file comprises the substeps of: determining the size of a load image of the computer file; determining the distance between an entry point of the computer file and an end of the load image of the computer file; and determining the type of the computer file. 7. A computer implemented method for detecting a polymoφhic virus in a computer file, the method comprising the steps of: initializing a list of known polymoφhic viruses generating an instruction/interrupt usage profile for each polymoφhic virus in the list; fetching an instruction from the computer file; comparing the fetched instruction with instruction/interrupt usage profiles for each listed polymoφhic virus to identify those polymoφhic viruses that can generate the fetched instruction; delisting each listed polymoφhic virus that can not generated the fetched instruction; when at least one polymoφhic virus remains listed, tagging a memory location associated with the fetched instruction and repeating the fetching, comparing, flagging, and tagging steps; and scanning the tagged locations for virus signatures when all listed polymoφhic viruses have been removed from the list. 8. A computer implemented method for determining whether an instruction fetched from a computer file may be part of a decryption loop generated by a polymoφhic virus infecting the computer file, the method comprising the steps: initializing a list of polymoφhic viruses; for each listed polymoφhic computer virus, generating a list of instructions and interrupts employed by the polymoφhic virus in producing decryption loops; and fetching instructions from the computer file and for each fetched instruction: comparing the fetched instruction with the list of instructions and interrupts used by each polymoφhic virus on the list; removing from the list of polymoφhic viruses each polymoφhic virus that does not employ the fetched instruction; and repeating the comparing and removing steps until all polymoφhic viruses have been removed from the list. 9. A computer readable storage medium on which is stored data for analyzing computer files for the presence of polymoφhic viruses, the data being suitable for implementation by a computer to perform the steps of: fetching an instruction from a computer file; determining whether the instruction may be used in decryption loops generated by known polymoφhic viruses identified in a list; when the instruction is used in decryption loops generated by know polymoφhic viruses, tagging a memory location associated with the instruction and repeating the fetching and determining steps; and scanning the tagged locations for virus signatures when the emulated instruction is not used in decryption loops generated by known polymoφhic viruses. 10. A system for testing a computer file for polymoφhic viruses, the system comprising: an emulation module for emulating instructions from the computer file to be tested; a scanning module including viral signatures to identify each polymoφhic virus to be tested for; and an emulation control module coupled to the scanning module and the emulation module, the emulation control module including: an instruction interrupt usage profile for each polymoφhic virus for identifying decryption loop instructions generated by the polymoφhic virus; and a dynamic emulation module for comparing computer file instructions processed by the emulation module with the instruction/interrupt usage profiles to determine whether the instruction may be from a polymoφhic virus decryption loop and triggering the scanning module to scan the file for viral signatures when the comparison indicates a scan condition has occurred. 1 1. An emulation control module for direecting emulation of a computer filed to be tested for a polymoφhic virus by an an emulation module, the emulation control module comprising: a table of known polymoφhic viruses; instruction/interrupt usage profiles for the known polymoφhic viruses; a dynamic exclusion module coupled to the instruction/interrupt usage profiles, the table, and the emulation module for comparing instructions fetched by the emulation module with the instruction/interrupt usage profiles of the known polymoφhic viruses in the table and excluding from the table polymoφhic viruses having instruction/interrupt usage profiles that are inconsistent with the fetced instruction, the dyanamic exclusion module being effective to determine whether the instruction may be from a decryption loop in the computer file; size/type data for known polymoφhic viruses; and a static control module coupled to the size/type data, the table, and the emulation module for excluding from the table polymoφhic viruses having size/data properties inconsistent with the size/type data in the table. 12. A computer implemented method for detecting polymoφhic viruses in a computer file, the method comprising the steps of; fetching instructions from the computer file; comparing the fetched instructions with instruction/interrupt usage profiles associated with listed polymoφhic viruses; tagging memory locations associated with the fetched instructions that are consistent with the instruction/interrupt usage profiles associated with the listed polymoφhic viruses; delisting polymoφhic viruses having associated instruction/interrupt usage profiles that are inconsistent with the fetched instructions; and scanning the tagged locations for virus signatures when all polymoφhic viruses have been delisted. 13. The method of claim 12, including the additional step of scanning the tagged memory location for virus signatures at preselected intervals of fetched instructions. 14. The method of claim 12, comprising the additional step of scanning the tagged locations for virus signatures when a preselected total number of the fetched instructions reaches a preselected number.

Inventors: NACHENBERG CAREY, NACHENBERG, CAREY
Applicants: SYMANTEC CORP, SYMANTEC CORPORATION
Application year: 1996
Main classification: G06F11
IPC codes: G06F1, G06F21