×

Announcing: Slashdot Deals - Explore geek apps, games, gadgets and more. (what is this?)

Thank you!

We are sorry to see you leave - Beta is different and we value the time you took to try it out. Before you decide to go, please take a look at some value-adds for Beta and learn more about it. Thank you for reading Slashdot, and for making the site better!

Comments

top

Computer Security, The Next 50 Years

Alan Cox Re:Mathematically provably secure? (234 comments)

There are several "provably secure" computer systems. As in you can demonstrate they fulfil certain mathematical constraints and those constraints are absolute. Then you have to write the code and prove the code, then you have to hope the prover is correct and the hardwareis correct. Nothing is 100%.

As to the randomisation stuff - yes I've got examples, and we've hit the same thing in Linux with randomisation. You get cases where memory scribbles cause a problem only if the layout happens to be a specific variant (especially with stack randomisation). From "either it dies or it works" you get "1 in 10,000 times xyz app blows up". That does make debugging much much harder. Of course a good reply to that is "so improve the debugging tools".

more than 8 years ago

Submissions

Alan Cox hasn't submitted any stories.

Journals

Alan Cox has no journal entries.

Slashdot Login

Need an Account?

Forgot your password?