Cryptology ePrint Archive: Report 2016/531

Reducing number field defining polynomials: An application to class group computations

Alexandre Gélin and Antoine Joux

Abstract: In this paper, we describe how to compute smallest monic polynomials that define a given number field $\mathbb K$. We make use of the one-to-one correspondence between monic defining polynomials of $\mathbb K$ and algebraic integers that generate $\mathbb K$. Thus, a smallest polynomial corresponds to a vector in the lattice of integers of $\mathbb K$ and this vector is short in some sense. The main idea is to consider weighted coordinates for the vectors of the lattice of integers of $\mathbb K$. This allows us to find the desired polynomial by enumerating short vectors in these weighted lattices. In the context of the subexponential algorithm of Biasse and Fieker for computing class groups, this algorithm can be used as a precomputation step that speeds up the rest of the computation. It also widens the applicability of their faster conditional method -- which requires a defining polynomial of small height -- to a much larger set of number field descriptions.

Category / Keywords: number theory, class group computation

Date: received 30 May 2016

Contact author: alexandre gelin at lip6 fr

Available format(s): PDF | BibTeX Citation

Note: Submitted to the Twelfth Algorithmic Number Theory Symposium (ANTS-XII)

Version: 20160531:065928 (All versions of this report)

Short URL: ia.cr/2016/531

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]