Every once in a while we all contemplate solving interesting yet kinda abstract threat hunting problems. This post describes one of these…<\/p>\n\n\n\n
The problem:<\/p>\n\n\n\n
Given a relatively long number of strings, how do you write a regular expression that covers them all, but doesn’t hit on any other string?<\/strong><\/p>\n\n\n\n The context:<\/p>\n\n\n\n I have extracted file names associated with kernel drivers referenced by all the .inf files present inside all of (unpacked) archives that can be found inside the DriverPack<\/a>. <\/p>\n\n\n\n The rationale:<\/p>\n\n\n\n Hunting for new kernel drivers introduced to the environment may be easier if I can extract kernel driver names from the telemetry, and only report creation of these that reference files that are NOT present on the ‘known list of good kernel driver file names’.<\/p>\n\n\n\n The solution:<\/p>\n\n\n\n Looking for existing tools that may help to address this problem in a generic way I came across this perl module – Regexp::Optimizer<\/a>. To my surprise, it actually works quite nicely. <\/p>\n\n\n\n I gave it 7.5K file names<\/a> associated with ‘known clean kernel module drivers’ and it gave me the following regex<\/a>. I have tested all the file names from the ‘ServiceBinary2su.txt’ file and the regex worked well. This is the test script:<\/p>\n\n\n\n use strict; $| = 1;<\/p>\n\n\n\n my $f=’regex.txt’; my $x=shift; The final regex is 52624 bytes long. The input data was 103317 bytes long (including new lines). We have achieved a 51% ‘compression rate’, but debugging of such a complicated regex pattern sounds like a heck of a job. It would seem that sometimes solving interesting yet kinda abstract threat hunting problems brings more confusion to the process than we anticipate… And getting fixated on using regexes to solve this kind of problem is actually a bigger problem itself. The multi-pattern search-oriented trie structures are far more suitable to solve this sort of multi-pattern search\/comparisons. <\/p>\n","protected":false},"excerpt":{"rendered":" Every once in a while we all contemplate solving interesting yet kinda abstract threat hunting problems. This post describes one of these… The problem: Given a relatively long number of strings, how do you write a regular expression that covers … Continue reading \n
use warnings;
use utf8;<\/p>\n\n\n\n
open F,”<$f”;
binmode F;
read F,my $regex,-s $f;
close F;<\/p>\n\n\n\n
if ($x=~\/^$regex.sys$\/i)
{
print (“$x matched\\n”);
}
else
{
print (“$x didn’t match\\n”);
}<\/p>\n<\/blockquote>\n\n\n\n