In recent years, difficult problems in Number Theory have played a fundamental role in algorithms in modern cryptography – often keeping our data secure when we use the internet.
We will discuss number theory and its applications in cryptography. In particular, Robert will illustrate the basic idea and equations which go into the encryption of data using large prime numbers, and that if you can find a way to tackle these underlying number theory problems then suddenly you have found a way to by-pass a lot of internet security.
Date: May 24
Time: 15:35 - 16:05