Generating random factored ideals in number fields
From MaRDI portal
Abstract: We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can produce a random ideal in the ring of algebraic integers uniformly at random among ideals with norm up to N, in polynomial time. We also present a variant of this algorithm for generating ideals in function fields.
Recommendations
Cites work
- Approximate formulas for some functions of prime numbers
- Generating random factored Gaussian integers, easily
- Generating random factored numbers, easily
- How to Generate Factored Random Numbers
- scientific article; zbMATH DE number 3912454 (Why is no real title available?)
- scientific article; zbMATH DE number 66619 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1954367 (Why is no real title available?)
- Introduction to algorithms
- PRIMES is in P
Cited in
(2)
This page was built for publication: Generating random factored ideals in number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637588)