Home page logo

fulldisclosure logo Full Disclosure mailing list archives

Re: Info about attack trees
From: coderman <coderman () gmail com>
Date: Mon, 28 May 2012 14:36:44 -0700

On Mon, May 28, 2012 at 10:49 AM, Georgi Guninski <guninski () guninski com> wrote:
some ...words you can use for profit:

division by _zero_, _integer_ overflow, attack _vector_, attack
_vector space_ [1], attack _curve_, attack _surface_, attack
_abelian surface_ [1], attack _group law_ [1] , attack _tree_,
attack _graph_, attack _constrained path on graph_ [1],
attack _turing machine_ [1], attack halting _problem_ [1].

you've written a prospectus or two, it seems.

...  I believe it to be infeasible to make an attack
tree against any modern system...

the best attack trees are planted in a firmament of bayesian machine
learning, nurtured with cloud based social graph analysis, and
precipitated via distributed simulation into actionable tactics with
certainty of execution. i have generated a truly marvelous
computer-assisted proof of this, which this message is unable to

the details just how many 0days rain down from this exploit cloud
shall sadly remain obscured... for now. anyone want to seed a 7.44TB

Full-Disclosure - We believe in it.
Charter: http://lists.grok.org.uk/full-disclosure-charter.html
Hosted and sponsored by Secunia - http://secunia.com/

  By Date           By Thread  

Current thread:
[ Nmap | Sec Tools | Mailing Lists | Site News | About/Contact | Advertising | Privacy ]