Our seminar series is free and available for anyone to attend. Unless otherwise stated, seminars take place on Wednesday afternoons at 2pm in the Kilburn Building during teaching season.

If you wish to propose a seminar speaker please contact Antoniu Pop.


Formal methods and cryptography: the beauty and the beast

  • Speaker:   Dr  Eerke Boiten  (University of Kent)
  • Host:   Richard Banach
  • 14th November 2012 at 14:15 in Lecture Theatre 1.4, Kilburn Building
There are two types of formal analysis involved in cryptography: there is the nice algebraic number theory, with easy to follow symbolic proofs (e.g., why encryption and decryption work together in RSA). Unfortunately, for more realistic modern applications in cryptography and security the theory involved is a lot more complex: involving probability theory, complexity theory and asymptotics. Proofs in this area aren't anywhere near as "nice", and more worryingly, this complexity is having a detrimental effect on confidence in solutions in this area. Coming at this from a background in formal methods and program derivation, I will give an overview of the main problems and some tentative solutions.The talk is intended for a wide audience, it will contain no deep mathematics or complex cryptographic constructions (except in illustrations designed to intimidate!)
▲ Up to the top