1 citations · 1 across the 2 of their papers we have counts for
2 papers
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…
cs.CR2023★ 1 cited
The supersingular Endomorphism Ring and One Endomorphism problems are equivalent
Aurel Page, Benjamin Wesolowski
The supersingular Endomorphism Ring problem is the following: given a supersingular elliptic curve, compute all of its endomorphisms. The presumed hardness of this problem is found…