Université Dalhousie, 4 - 7 juin 2013
Class group and unit group computation are essential tasks in computational number theory. In particular, they occur in the resolution of Diophantine equations and in the test of many unproven number theoretic conjectures.
Class group and unit group computation for number fields of small degree
can be speeded up greatly by the use of sieving algorithms. We will
describe how sieving methods originally developped for factoring large
numbers can be adapted for our purposes and report experiments showing that
this provides a significant speed-up.