Cryptography as it is being used today relies on the assumed difficulty of solving either the Integer Factoring Problem or the Discrete Logarithm Problem. While no efficient algorithms for solving either problem on a classical computer are known, a large-scale quantum computer can solve both problems quickly using Shor's algorithm. Post-Quantum Cryptography deals with this (potential) future threat by basing cryptography on other mathematical problems.
My research is about developing faster algorithms to solve the mathematical problems used in post-quantum cryptography, in order to test if we can trust that the problems truly are difficult, both on classical and quantum computers. For a list of most of my publications, see DLBP.
I graduated with a Ph.D. in Cryptology in January 2021 and a M.Sc. in Mathematical Engineering in August 2016, both at Lund University, Sweden. My Ph.D. Thesis and Master Thesis can be found here and here respectively. As of March 2021 I am a postdoctoral researcher at University of Bergen, Norway.
In the spring of 2022 I teach Discrete Structures (MNF130). The course is an introduction to discrete mathematics and some concept in computer science. It covers mathematical logic, set theory, number theory, graph theory, algorithm design using trees and so on.
- (2021). On the Sample Complexity of solving LWE using BKW-Style Algorithms. IEEE International Symposium on Information Theory. Proceedings.
- (2021). Improvements on making BKW practical for solving LWE. Cryptography. 24 pages.