Abstract:

This paper presents an algorithm for the subfield problem based on the minimal polynomials of the number fields. The algorithm is guaranteed to success and only lifts some special factors after factoring polynomials mod p. The experimental results show that it is more efficient than the algorithm based on the factorization over number fields in most cases.

Key words: subfield problem, resultant, isomorphism