Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power

DOI10.4230/LIPICS.APPROX-RANDOM.2014.643MaRDI QIDQ2969652zbMATHOpenAlexFDO

Authors Thomas Holenstein, Chandan K. Dubey

Publication date 22 March 2017

Full work available at URL https://doi.org/10.4230/lipics.approx-random.2014.643

zbMATH Keywords

latticesquadratic formsmodularp-adic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quadratic and bilinear Diophantine equations (11D09) Congruences in many variables (11D79) Quadratic forms over global rings and fields (11E12) Number-theoretic algorithms; complexity (11Y16) Counting solutions of Diophantine equations (11D45) Computer solution of Diophantine equations (11Y50)

Recommendations

• Sampling and the eigenvalues of a quadratic pencil
• Sampling algebraic varieties for sum of squares programs
• On the distribution of quadratic residues modulo a prime
• Solving Bivariate Quadratic Congruences in Random Polynomial Time
• On the discrepancy of uniformly distributed roots of quadratic congruences
• scientific article; zbMATH DE number 1076765
• Equidistribution of roots of a quadratic congruence to prime moduli
• scientific article; zbMATH DE number 3236166
• Statistical distribution of roots of a polynomial modulo prime powers
• On the distribution of quadratic residues

Cited in

(2)

• Hull attacks on the lattice isomorphism problem
• Solving Bivariate Quadratic Congruences in Random Polynomial Time

This page was built for publication: Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969652)