The Mathematics of Post-Quantum Cryptography

Castryck, Wouter and Ducas, Leo and Ehlen, Stephan and Kunzweiler, Sabrina and Randriam, Hugues and Trimoska, Monika and van Woerden, Wessel (2024) The Mathematics of Post-Quantum Cryptography. In: The Mathematics of Post-Quantum Cryptography, 4-5 December 2024, MPIM Bonn. (Unpublished)

[thumbnail of Conference program and abstracts.]
Preview
Text (Conference program and abstracts.)
conference-program.pdf - Supplemental Material

Download (93kB) | Preview
[thumbnail of Stephan Ehlen: Welcome & introduction]
Preview
Text (Stephan Ehlen: Welcome & introduction)
Ehlen-Introduction.pdf - Presentation

Download (485kB) | Preview
[thumbnail of Wouter Castryck: Interpolating isogenies between elliptic curves: destructive and constructive applications]
Preview
Text (Wouter Castryck: Interpolating isogenies between elliptic curves: destructive and constructive applications)
Castryck.pdf - Presentation

Download (599kB) | Preview
[thumbnail of Leo Ducas: Principles of Lattice Cryptography, and cryptanalysis by lattice reduction [last part on blackboard missing]]
Preview
Text (Leo Ducas: Principles of Lattice Cryptography, and cryptanalysis by lattice reduction [last part on blackboard missing])
Ducas.pdf - Presentation

Download (3MB) | Preview
[thumbnail of Monika Trimoska: Algebraic cryptanalysis applied to equivalence problems [the zip-File contains the HTML presentation]] Archive (Monika Trimoska: Algebraic cryptanalysis applied to equivalence problems [the zip-File contains the HTML presentation])
Trimoska.zip - Presentation

Download (37MB)
[thumbnail of Hugues Randriam: The syzygy distinguisher]
Preview
Text (Hugues Randriam: The syzygy distinguisher)
Randriam.pdf - Presentation

Download (1MB) | Preview
[thumbnail of Sabrina Kunzweiler: Isogeny-based group actions in cryptography]
Preview
Text (Sabrina Kunzweiler: Isogeny-based group actions in cryptography)
Kunzweiler.pdf - Presentation

Download (601kB) | Preview
[thumbnail of Wessel van Woerden: Dense and smooth lattices in any genus]
Preview
Text (Wessel van Woerden: Dense and smooth lattices in any genus)
vanWoerden.pdf - Presentation

Download (1MB) | Preview
[thumbnail of Opening]
Preview
Image (Opening)
IMG_5954.jpeg - Other

Download (2MB) | Preview
[thumbnail of Wouter Castryck]
Preview
Image (Wouter Castryck)
IMG_5958.jpeg - Other

Download (2MB) | Preview
[thumbnail of Peter Stevenhagen]
Preview
Image (Peter Stevenhagen)
IMG_5960.jpeg - Other

Download (1MB) | Preview
[thumbnail of Leo Ducas]
Preview
Image (Leo Ducas)
IMG_5962.jpeg - Other

Download (1MB) | Preview
[thumbnail of Monika Trimoska]
Preview
Image (Monika Trimoska)
IMG_5963.jpeg - Other

Download (2MB) | Preview
[thumbnail of Hugues Randriam]
Preview
Image (Hugues Randriam)
IMG_5967.jpeg - Other

Download (2MB) | Preview
[thumbnail of Sabrina Kunzweiler]
Preview
Image (Sabrina Kunzweiler)
IMG_5971.jpeg - Other

Download (1MB) | Preview
[thumbnail of Severin Barmeier]
Preview
Image (Severin Barmeier)
IMG_5972.jpeg - Other

Download (2MB) | Preview
[thumbnail of Wessel van Woerden]
Preview
Image (Wessel van Woerden)
IMG_5974.jpeg - Other

Download (2MB) | Preview

Abstract

Post-Quantum cryptography is a branch of public-key cryptography aiming to design cryptographic schemes building on mathematical problems that are conjectured to be hard to solve on both, classical and quantum computers. Such cryptographic schemes are needed since Shor's quantum algorithms break classical public-key cryptography based on the discrete logarithm problem (in finite fields or elliptic curves) as well as integer factoring in polynomial time (assuming a large enough error-corrected quantum computer will be built).

The main families of post-quantum schemes build on algorithmically hard problems related to lattices (e.g. finding short vectors in euclidean lattices), binary codes (decoding problem), isogenies between elliptic curves over finite fields, and multivariate polynomial systems. More recently, schemes based on finding isometries between lattices and also schemes based on group actions of classical groups have been proposed.

Hence, there are many connections between the research field of post-quantum cryptography and number theory, automorphic forms, algebra, algebraic geometry, representation theory, and so on. In order to evaluate the security of the newly proposed cryptographic schemes, deep connections between the different research communities, in particular between more applied researchers in cryptography and researchers in pure mathematics, have to be established. Otherwise, results from pure mathematics that apply to these schemes and the underlying mathematical problems might be overlooked by the cryptographic research community or discovered many years later.

Item Type: Conference or Workshop Item (Lecture)
Subjects: 1 Discrete mathematics / algebra > 11-XX Number theory
1 Discrete mathematics / algebra > 14-XX Algebraic geometry
4 Applied mathematics / other > 68-XX Computer science
4 Applied mathematics / other > 81-XX Quantum theory
Divisions: Research > Talks
Depositing User: This Admin
Date Deposited: 09 Dec 2024 15:00
Last Modified: 09 Dec 2024 15:24
URI: https://archive.mpim-bonn.mpg.de/id/eprint/5143

Actions (login required)

View Item View Item