News for hackers. Stuff that matters.
Re:Ask HN: What is your favorite CS paper? by mdasen on Thursday August 24, 2017 @06:28PM (#15094603)
You can actually detect the issue in Trusting Trust: https://www.schneier.com/blog/archives/2006/01/countering_tr...

If you have two compilers and one is open source (and you've read the source and happy that it's clean), you can compile that source with both compilers. The output will be different because the two compilers will make different optimizations. However, now you have two binaries of the same compiler and while they aren't the same, their output will be. So you can re-compile the source with both new binaries and you should get a bit-for-bit equivalent output.

Re:Ask HN: What is your favorite CS paper? by nialv7 on Friday August 25, 2017 @01:29AM (#15096324)
You can not. The point is you cannot run the code of a compiler, you have to run the compiled binary. And there's no way to verify if the binary does the same thing as the code when the Ken Thompson Hack is implemented.
Re:Ask HN: What is your favorite CS paper? by jhgb on Friday August 25, 2017 @12:08PM (#15099516)
Aren't there C interpreters still around?
Re:Ask HN: What is your favorite CS paper? by nialv7 on Friday August 25, 2017 @03:56PM (#15101670)
How can you be sure there's no Ken Thompson Hack in the interpretor?
Re:Ask HN: What is your favorite CS paper? by jhgb on Saturday August 26, 2017 @02:28PM (#15106684)
How would there be one? It's not like you can easily write a program that infiltrates a random program A that happens to interpret a language in which a random program B is written and infiltrates the B program afterwards. You'd probably need a general-artificial-intelligence-level in your malware.