The Computational Number Theory group is especially interested in three different research questions:

1. Analysing the complexity of the Simultaneous Chinese Remainder problem involves examining how difficult it is to solve when compared to the classical Chinese Remainder Theorem (CRT). In this generalized version, instead of having a unique residue as in CRT, we deal with a set of possible residues. The challenge lies in determining practical algorithms to solve this problem efficiently, considering several factors such as conditions for moduli, residue sets, and the desired outcome.
2. There are indications that solutions to the Simultaneous Chinese Remainder problem could offer new avenues for addressing the integer factorization problem.
3. Lattice basis reduction is a fundamental problem in computational number theory. Our research group investigates the extent to which graph-based approaches can contribute to efficiently solving this problem in number theory.