listen to this article:

In our latest video from Prof Smart we hear about a number of issues in cryptography:

The one which sticks out is how to securely implement online dating. This is particularly timely given the recent upgrade to Tinder in encrypting photos…Prof Smart however talks about how to engage in an application in which you can find out who should be your eventual partner using Multi-Party Computation. In this way, one could implement a service like Tinder without the service provider learning any information about their users at all.

In other questions, Prof Smart discusses how cryptographers define what security actually means, and the deep problem in Computer Science of whether P=NP or not? This problem is so famous that any person who solves it will win a million-dollar prize.

To learn more, watch the latest episode of Ask the Professor with Prof. Nigel Smart!