Most encryption schemes are based on a trapdoor function, which is easy to compute the one way and thought to be very hard to reverse without a special key. These encryption schemes have never been unbreakable, but they are designed in such a way that it is considered infeasible to reverse them. But what happens if the trapdoor function that we rely on is suddenly found out to be reversible by quantum computers? And what can be done to ensure forward secrecy?
These are some of the questions we will address tonight, as quantum computing could be at the cusp of breaking RSA. Luckily the McEliece system is immune to attacks by Shor’s algorithm. Find out why this is the case and why we do not use it today, even though the current standards are no longer secure.
About the Speaker:
Freja is a Ph.d student specialized in post quantum cryptography at DTU, Department of Mathematics and Computer Science. Her thesis evaluates the strengths and weaknesses of McEliece compared to other candidates for a new public key encryption primitive.
Organizer: Anton Rydahl, IDA IT
Catering: Coffee and tea at the beginning, and a soda and fruit in the break.
Free for members of IDA IT and Dansk IT
ANYONE CAN JOIN - Most of IDA's events are open to everyone, but you must have an IDA user profile in order to participate. It's free and non-binding - create a user profile now. As a member of IDA, you get a discount on many of our events, so please sign in with your member login when you sign up for an event. Read more about the benefits of an IDA membership here.