Sabrina Kunzweiler
Researcher in Cryptography and Number Theory
Researcher in Cryptography and Number Theory
I am an ISFP researcher (Inria starting faculty position) at Inria Bordeaux in France and member of the Canari team. Before joining Inria, I was part of the cryptography group at Ruhr University Bochum in Germany. I completed my PhD in December 2020 at the Institute of Algebra and Number Theory at Ulm University under the supervision of Stefan Wewers.
New preprint: Radical 2-isogenies and cryptographic hash functions in dimensions 1, 2 and 3.
Our paper Computing modular polynomials by deformation was accepted at ANTS XVI .
The 25th Workshop on Elliptic Curve Cryptography (ECC) in Taipei (Oct 30 - Nov 1): I will speak about isogeny computations at the workshop, and give a lecture in the autumn school on supersingular isogenies.
Conference on Mathematics of Post-Quantum Cryptography at the MPIM in Bonn (Dec 14 - Dec 15): I will give a talk on isogeny-based group actions.
CIMPA school on Effective Algebra and the LMFDB at Makerere University in Uganda (Jan 13 - Jan 24, 2025): Together with Sorina Ionica, I will lead one of the research groups.
Most of my academic degrees are from Ulm University in Germany. But I also studied one year at the Universidad de Cantabria in Spain during my Bachelor, and participated in a double-degree program with Syracuse University in the United States during my Master.
Ph.D. in Mathematics, Ulm University, 2020
M.S. in Mathematics, Ulm University, 2018
M.S. in Mathematics, Syracuse University, 2017
B.S. in Mathematics, Ulm University, 2015
I'm interested in computational aspects of number theory, algebraic geometry and the applications to cryptography. Some of my research topics:
I'm currently working on algorithms for computing isogenies of principally polarized abelian varieties. These algorithms have applications in isogeny-based cryptography which is one of the proposals for post-quantum cryptography. In general, I'm interested in investigating higher-dimensional analogues of cryptographic protocols based on elliptic curves.
I study cryptographic protocols based on group actions, in particular the CSIDH group action. This includes the security analysis of such schemes, the development of generic models, and the design of new protocols.
During my PhD I studied the computation of models of curves and developed algorithms for computing the lattice of integral differential forms. Related to this topic, I also like to think about conductor-discriminant inequalities.
Most of my work includes some explicit computations, algorithms or formulas. Here, you'll find links to the code supporting the publications (written by my coauthors or me).
The SageMath package about superelliptic curves (with my PhD advisor Stefan Wewers) can be used to compute the lattice of integral differentials of a superelliptic curve. Checkout my thesis for more details.
The SageMath package about cluster pictures by Alex J. Best and Raymond van Bommel includes my formulas for computing integral differentials on hyperelliptic curves with semistable reduction; and you can also compute many more local invariants (see our "User's guide to the local arithmetic of hyperelliptic curves").
The Repository about Ciani quartics contains some extra material for our paper "Reduction types of genus-3 curves in a special stratum of their moduli space". In particular, there is SageMath code to compute the semistable reduction of a given Ciani quartic.
The Repository about (3,3)-isogenies was developed in a joint work with Thomas Decru. It contains symbolic proofs for the splitting and gluing formulas that we found, and an implementation of our algorithm for computing (3,3)-isogeny chains. You can use it to break the SIKE challenges!
The Repository about Richelot isogenies It contains different algorithms for computing chains of (2,2)-isogenies. This includes the algorithms developed in Efficient computation of (2n,2n)-isogenies, and some newer versions, working on the Kummer surface. You can also use this to break the SIKE challenges.
The SageMath Package for computing modular polynomials This contains the implementation of a new algorithm for computing modular polynomials of elliptic curves. The algorithm is based on the theory of deformations and also uses the (2,2)-isogeny chains from above. It was developed in joint work with Damien Robert.
In Ulm and Syracuse, I was a teaching assistant for the following courses.
Calculus II at Syracuse University (Fall 2016, Spring 2017)
Elements of Abstract Algebra at Ulm University (Fall 2017)
Seminar about geometry at Ulm University (Fall 2017)
Elementary Number Theory at Ulm University (Spring 2018, Spring 2020)
Seminar about primality testing at Ulm University (Spring 2018)
Linear algebra I at Ulm University (Fall 2018, Fall 2019)
Linear algebra II at Ulm University (Spring 2019)
Diophantine Equations at Ulm University (Fall 2019)