Security of software and of communication is currently a major concern
Security of software and of communication is currently a major concern. Public key cryptography techniques are based on the computational intractability of the associated code breaking problem. However this is normally judged on worst case complexity and better measures of security are needed. One possible approach is the use of time bounded versions of Kolmogorov complexity. Another problem arises from the need to execute foreign code that may open the door to attacks. One solution is to force foreign code to include a proof that it will not break security. This however requires support for the development of proofs of program properties.