2016 6th International Conference on Computers Communications and Control (ICCCC) 2016
DOI: 10.1109/icccc.2016.7496733
|View full text |Cite
|
Sign up to set email alerts
|

Obfuscation procedure based in dead code insertion into crypter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 3 publications
0
9
0
Order By: Relevance
“…Packer classification has been also performed recently, but most of the classification or identification methods use signature‐based features, such as header information or decompression/decryption code. However, signature‐based approaches can be easily avoided by attackers through code relocation and other methods …”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Packer classification has been also performed recently, but most of the classification or identification methods use signature‐based features, such as header information or decompression/decryption code. However, signature‐based approaches can be easily avoided by attackers through code relocation and other methods …”
Section: Related Workmentioning
confidence: 99%
“…However, signature-based approaches can be easily avoided by attackers through code relocation and other methods. 9,10,30,31 To overcome those limitations, our proposed method uses features extracted only from an encrypted section. A packing algorithm is usually based on the Lempel-Ziv (LZ) and Lempel-Ziv-Markov chain algorithm (LZMA) compression algorithms; hence, we surveyed about the mechanisms of compression algorithms and the characteristics of the outputs of those algorithms.…”
mentioning
confidence: 99%
“…If the 1 Mb output file is used, it is possible to create copies every 1000 bytes (offset with 0.1 percent of the total file size), and the proper analysis is made, considering only the portion of 1000 bytes that is undetected. Copies are then created every 100 bytes over it, and this procedure is repeated until reaching the portion of 1 byte [5], considering that the ranges are not necessarily consecutive. Thus, hardware use increases, and the number of created files decreases, so the antivirus testing time also decreases.…”
Section: Current Malware Updating Processmentioning
confidence: 99%
“…The process of taking a program whose signature is already recognized by anti-malware systems as a threat, and transforming it in such a way that is no longer detected, without losing functionality, is described by Barría et al as an iterative process of malware "update" [19]. This process involves a procedure cycle, where malware is encrypted thanks to a Crypter, to then be analyzed by one or more anti-malware systems.…”
Section: Current Malware Update Processmentioning
confidence: 99%