Solving the Decision Principal Ideal Problem with Pre-processing

Abstract

The principal ideal problem constitutes a fundamental problem in algebraic number theory and has attracted significant attention due to its applications in ideal lattice based cryptosystems. Efficient quantum algorithm has been found to address this problem. The situation is different in the classical computational setting. In this work, we delve into the relationship between the principal ideal problem and the class field computation. We show that the decision version of the problem can be solved efficiently if the class group is smooth, after pre-computation has been completed to collect information about the Hilbert class field.