Generating a Quadratic Forms from a Given Genus

Abstract

Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis (GRH).

arXiv admin note: text overlap with arXiv:1409.6199

References in corpus (2)

• Computing the $p$-adic Canonical Quadratic Form in Polynomial Time
• Sampling a Uniform Random Solution of a Quadratic Equation Modulo $p^k$