Using entropy analysis to find encrypted and packed malware

IEEE Security and Privacy

Volumn 5, Issue 2, 2007, Pages 40-45

  Lyda, Robert ^a   Hamrock, James ^a  

^a McDonald ^*  (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY FILE BYTES; BINTROPY; MALWARE COLLECTIONS; PACKED MALWARE;

BINARY SEQUENCES; PROGRAM DEBUGGING; RANDOM PROCESSES; SOFTWARE ENGINEERING; STATISTICAL METHODS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 34047129159     PISSN: 15407993     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2007.48     Document Type: Review

References (5)

1. T. Brosch and M. Morgenstern, "Runtime Packers: The Hidden Problem," Proc. Black Hat USA, Black Hat, 2006; www.blackhat.com/ presentations/bh-usa-06/BH-US-06-Morgenstern.pdf.
2. C.E. Shannon and W. Weaver, The Mathematical Theory of Communication, Univ. of Illinois Press, 1963.
3. R.W. Hamming, Coding and Information Theory, 2nd ed., Prentice-Hall, 1986.
4. M. Haahr, "An Introduction to Randomness and Random Numbers," Random.org, June 1999; www.random.org/essay.html.
5. A. Stephan, "Improving Proactive Detection of Packed Malware," Virus Bulletin, 01 Mar. 2006; www.virusbtn.com/virusbulletin/archive/ 2006/03/vb200603-packed.