Generating Random Factored Ideals in Number Fields
December 15, 2016 Β· Declared Dead Β· π Mathematics of Computation
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.NT
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
An analogue of Vosper's Theorem for Extension Fields
R.I.P.
π»
Ghosted
Improved torsion point attacks on SIDH variants
R.I.P.
π»
Ghosted
Ramanujan graphs in cryptography
R.I.P.
π»
Ghosted
Locally Recoverable Codes with Availability $t\geq 2$ from Fiber Products of Curves
R.I.P.
π»
Ghosted
Failing to hash into supersingular isogeny graphs
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted