Speaker: Alexander Mueller-Hermes Title: Fault-tolerant coding for quantum communication Location: Zoom (link in Google Group) Abstract: Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that […]
Speaker: Oskar Goldhahn Abstract: We present some of the machinery used to formally verify the correct implementation of classical algorithms, including post-quantum cryptography, and how this can be extended to algorithms that use quantum computers.
Speaker: Hans Heum Title: Cryptographic Group Actions in a Quantum World Abstract: The Group Action formalism generalizes the familiar discrete-logarithm based hardness assumptions in such a way that post-quantum security can be recovered. In particular, post-quantum group actions have been shown to be instantiable from isogeny-based cryptography, such as CSIDH and more recently PEGASIS. Thus, many useful results from the […]
Speaker: Manuel Goulão Paper: https://eprint.iacr.org/2025/1506 Title: Superposition Attacks Against LPN-Based Authentication Protocols Abstract: Quantum security most commonly encompasses only offline passive quantum attacks, where a quantum computer is used by an adversary to solve some computationally hard problem, e.g. factoring or discrete logarithm. However, we are witnessing major efforts for the development and deployment of […]
Speaker: Olai Mostad (Simula UiB) Title: Quantum LDPC codes Abstract: Recently, there has been some debate on how many qubits a quantum computer needs to be cryptographically relevant. Last year, the best educated guess was one million, and today it is 10,000. We will take a look at one of the main reasons for the drastic cut […]
Speaker: Jan Erik Håkegård Title: TBA
