ResearchIndex

journal:

CACM

abstract:

In his Turing award lecture, Ken Thomson shows that a Trojan horse can be hidden in a compiler; it inserts copies of itself every time either the compiler or the login program is compiled.

volume:

27

number:

8

note:

Turing Award lecture

month:

aug

annote:

interesting introductionary paper on why trust is a tricky business. Example given is a trojan horse in login program which eventually is unnoticeable as it's hidden in the compilers binary and not visible in the source anymore ... Appeared also \cite{AshGra86} and in \cite{Dennin90}

type:

misc

pages:

761--763