2 papers
math.NT2026
Rigorous methods for computational number theory
Koen de Boer, Alice Pellet-Mary, Benjamin Wesolowski
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended…
math.NT2025
Average hardness of SIVP for module lattices of fixed rank
Koen de Boer, Aurel Page, Radu Toma +1
The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a…