Modul:   MAT076  Neuchatel - St.Gallen - Zurich Seminar in Coding Theory and Cryptography

An Analysis of the Number of Reduction Steps for Special Two-Dimensional Lattices

Talk by Julia Elena Würsch

Date: 23.09.26  Time: 15.15 - 16.15  Room: Y27H28

Video Streams

This talk analyzes the reduction-step behavior of the Gaussian lattice-reduction algorithm on lattices arising from ideals in imaginary quadratic fields, which appear in isogeny-based cryptography. We focus on the probability that the algorithm requires more than a fixed number of reduction steps and model how these lattices are distributed geometrically. Using these geometric insights, we propose a line-intersection model that predicts the distribution of number of reduction steps and compare it with experimental data.