Can we efficiently compile a computer program P into another one say \tilde{P}, which has the same functionality as P on every input, but otherwise is as unintelligible as possible? This question was asked in 1976 by the Turing award winning work of Diffie-Hellman (STOC 1976). S…
