[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <200507300212.j6U2Cea3005825@turing-police.cc.vt.edu>
Date: Sat Jul 30 03:12:50 2005
From: Valdis.Kletnieks at vt.edu (Valdis.Kletnieks@...edu)
Subject: Cisco IOS Shellcode Presentation
On Fri, 29 Jul 2005 15:02:51 -1000, Jason Coombs said:
> There are any number of technical solutions that one could use to
> redesign, fundamentally, the turing machine so that before each
> operation is performed a verification step is employed to ensure that
> the operation is the correct one in the correct sequence given prior
> configuration settings loaded into memory at the time the device was
> activated.
Ahem. No. You *can't* "ensure" it (although you *can* do things like bounds
checking to *minimize* issues).
It's called the Turing Halting Problem, and in fact, the 'Turing machine' was
invented specifically to (a) show the problem for that simple architecture, and
then (b) show that all Turing-equivalent systems have the exact same problem.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 226 bytes
Desc: not available
Url : http://lists.grok.org.uk/pipermail/full-disclosure/attachments/20050729/51e67287/attachment.bin
Powered by blists - more mailing lists