PhD - Cryptanalysis of Post-Quantum Cryptosystems

Position: PhD Candidate - Cryptanalysis of Post-Quantum Cryptosystems
Offer Description  Quantum computing allows the invention of some algorithms that are much more efficient than classical algorithms at solving specific problems. In particular, Shor’s algorithm [Shor
97] allows a sufficiently powerful quantum computer to recover private keys from public keys for legacy cryptosystems, by factoring RSA public moduli [Ekerå21] and breaking the (EC)
DLP [RNSL
17].
The security of post-quantum cryptosystems remains a subject of interest in order to establish safe parameter sets, particularly for concrete instances – rather than asymptotic estimates – for the more recent problems in so-called lattice-based cryptography [APS
15]. This is not only relevant to standardized primitives, but especially for cryptosystems that are still under development for advanced applications, such as threshold signatures, functional encryption, multiparty computation, and homomorphic encryption.
The candidate’s research will focus on an assessment of the level of security of concrete instances of post-quantum cryptosystems, through cryptanalytic techniques as well as practical software simulation of quantum information algorithms [LM21][PBP
21].

#J-18808-Ljbffr