News for hackers. Stuff that matters.
Re:Computing with traps by amelius on Monday June 29, 2015 @04:42PM (#9800891)
> All security is through solutions being obscure. I don't understand this criticism. Encryption just puts mathematical bounds on the obscurity

There is a difference. Once somebody writes a tool to unravel the obscurity, it is simple and fast for everybody to break the security.

Not so with encryption (if used properly, with changing keys, one-time passwords, etc.)

Re:Computing with traps by duaneb on Tuesday June 30, 2015 @11:33AM (#9806008)
> Once somebody writes a tool to unravel the obscurity, it is simple and fast for everybody to break the security.

Yes, it has a lower bound. But that tool has a high obscurity level itself. So the lower bound on breaking the security is finding someone who can write that tool.

Not great, but decent to buy time, as I said before :)