[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Tue, 6 Jul 2010 19:04:01 -0700
From: coderman <coderman@...il.com>
To: "Tomas L. Byrnes" <tomb@...neit.net>
Cc: funsec@...uxbox.org, full-disclosure@...ts.grok.org.uk,
Joel Esler <joel.esler@...com>, Gadi Evron <ge@...uxbox.org>
Subject: Re: [funsec] The Economist, cyber war issue
On Tue, Jul 6, 2010 at 3:58 PM, Tomas L. Byrnes <tomb@...neit.net> wrote:
> ...
> So the solution is to take what is currently an NP-complete problem for
> individual nodes: string matching and behavioral analysis; and turn it
> into a bounded problem across all participating nodes
that method is only applicable to a small and less useful set of
measurements / modeling of critical infrastructure. there is rarely
need to consider the minutiae of so many small details. (though
NSA/DIA would argue otherwise ;)
for the majority of targeting you need only concern yourself with the
larger path / node aggregation points to discern the few points /
paths of interest. the few points referring to power and other law
distributions applicable to critical infrastructure network topology
across every industry.
i bet there's an archive / bibliography of the all details somewhere
in a walled garden. C.I research is not viewed favorably as a public
and available pursuit...
best regards,
_______________________________________________
Full-Disclosure - We believe in it.
Charter: http://lists.grok.org.uk/full-disclosure-charter.html
Hosted and sponsored by Secunia - http://secunia.com/
Powered by blists - more mailing lists