Speaker 1: Prof Neil Koblitz, University of Washington
Time: 14.30 – 15.30
Title: Introduction to some computer-science aspects of cryptography
Using graph theory (perfect codes, related to error-correcting codes) a cryptosystem based on an NP-complete problem is constructed, (but without going into any detail on NP-completeness). The reduction from one problem to another, polynomial time vs exponential blow-up, message-recovery attacks on a cryptosystem, key-recovery attacks, chosen-ciphertext attacks will be presented.
Tea/Coffee: 15.30 – 16.00
Speaker 2: Dr Gareth Boxall, Stellenbosch University
Time: 16.00 - 17.00:
Title: Rational Points on graphs of analytic functions