Let Q(α) and Q(β) be linearly disjoint number fields and let Q(θ) be their compositum. We prove that the first-degree prime ideals of Z[θ] may almost always be constructed in terms of the first-degree prime ideals of Z[α] and Z[β], and vice-versa. We also classify the cases in which this correspondence does not hold, by providing explicit counterexamples. We show that for every pair of coprime integers d, e ∈ Z, such a correspondence almost always respects the divisibility of principal ideals of the form (e + dθ)Z[θ], with a few exceptions that we characterize. Finally, we discuss the computational improvement of such an approach, and we verify the reduction in time needed for computing such primes for certain concrete cases.for producing first-degree primes of Z[θ], outperforming the standard algorithm of a linear factor which depends on the smoothness of the extension degreeMore precisely, employing the convenient description of such primes [7] asand such an operation is proved to describe the vast majority of such primes. Furthermore, the divisibility of principal ideals (e + dθ)Z[θ] is respected in all but exceptional cases, which are fully characterized. Such results lead to a bottom-up approach that may be employed for speeding the production of these primes up, as well as for designing new approaches based on the smaller extensions, whose usage is often preferable. The employed hypotheses are not truly restrictive: every pair of reasonably uncorrelated fields happens to be linearly disjoint [10,17], thus every composite extension may be realized this way, with a suitable choice of sub-extensions. The exceptional cases are precisely identified, and ad hoc examples are provided to show that every given hypothesis is essential.This work extends a previous work of the authors [22], which addresses this problem when the considered number fields are biquadratic. However, the techniques employed and developed in the current paper are more sophisticated and lead to a deeper comprehension of the involved objects. The novel results not only generalize those of [22], but also provide practical tools that may be applied to a much wider range of situations, such as those that are conventionally adopted for the GNFS implementation, namely, nowadays, degree-6 extensions.This paper is organized as follows: in Section 2 the basic results about resultant and linearly disjoint extensions are recalled and combined to identify the number fields considered in the present work. Section 3 is devoted to defining the first-degree prime ideals combination and to detailing the cases when this construction establishes a complete correspondence with the first-degree prime ideals of the sub-fields. Such an association is proved to respect the divisibility of prescribed principal ideals in Section 4. In Section 5, the complexity of a combination-based approach for computing first-degree prime ideals is discussed, and a computational comparison with the current method is presented. Finally, in Section 6 we review the work and hint at poss...