# Enumerating prime ideals in SAGE

Given a number Field K and its ring of integers $O_K$, I want to enumerate prime ideals and calculate some quantities in $O_K$ modulo the prime ideals. This computation depends on the size of the ideal.

What I did earlier was taking a prime number, creating its ideal, factorizing it and using the factors as prime ideals. But this way I think I am doing very large computations because the norm would be very high.

I want to enumerate prime ideals below a certain norm in SAGE. What can I do?

Related: