Martin plans to present a simple encryption scheme which unlike RSA is believed to be secure against quantum computers. For this, he will start with revisiting how RSA encryption works, why the well-known textbook RSA is insecure, how RSA fails in practice when poor random number generators are used and how, somewhat surprisingly, adding a bit of noise to the underlying problem results in schemes that are believed to be secure in a post-quantum world. He will also talk about algorithms to attack this scheme and, time permitting, what all that has to do with Google’s post-quantum experiment in Chrome.
YOU MAY ALSO LIKE:
- Brian Sletten's Data Science with Python Workshop (in London on 18th - 20th November 2019)
- Fast Track to Machine Learning with Louis Dorard (in London on 2nd - 4th December 2019)
- Scala eXchange London 2019 (in London on 12th - 13th December 2019)
- Practical ML 2020 (in London on 2nd - 3rd July 2020)
- Knowledge Graph Applications in the Legal Profession & Fashion Industry (in London on 22nd October 2019)
- Business Agility and Continuous Compliance (in London on 22nd October 2019)
- How AI can be used to enable assisted living for the ageing population (SkillsCast recorded in October 2019)
- The importance of DataOps (SkillsCast recorded in October 2019)
Greatest Common Divisors: Attacks on RSA and Post-Quantum Security
Martin is a lecturer in the Information Security Group at Royal Holloway, University of London. His research is focused on all aspects of cryptography. He works on algorithms for solving the mathematical problems underlying it, on post-quantum security and fully homomorphic encryption. He also works on the cryptanalysis of deployed cryptographic protocols and implementations (SSH, TLS). He teaches applied cryptography and penetration testing.