Generating Random Factored Ideals in Number Fields

December 15, 2016 Β· Declared Dead Β· πŸ› Mathematics of Computation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zachary Charles arXiv ID 1612.06260 Category math.NT Cross-listed cs.DS Citations 0 Venue Mathematics of Computation Last Checked 1 month ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.NT

Died the same way β€” πŸ‘» Ghosted