Solving Bivariate Quadratic Congruences in Random Polynomial Time

DOI10.2307/2007870zbMATH Open0622.10003OpenAlexW4231440355MaRDI QIDQ3758905FDOQ3758905

Kevin S. McCurley, Leonard M. Adleman, Dennis R. Estes

Publication date: 1987

Full work available at URL: https://doi.org/10.2307/2007870

Recommendations

• An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>
• A New Look at an Old Equation
• Solving quadratic equations using reduced unimodular quadratic forms
• Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power
• Efficient solution of rational conics

zbMATH Keywords

randomized algorithmbinary quadratic formbivariate quadratic congruence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Congruences; primitive roots; residue systems (11A07) Primes (11A41) Software, source code, etc. for problems pertaining to number theory (11-04)

Cited In (9)

• Solving quadratic equations using reduced unimodular quadratic forms
• Efficient solution of rational conics
• Title not available (Why is that?)
• Randomized algorithms in number theory
• Cryptography Based on Quadratic Forms: Complexity Considerations
• A security analysis of uniformly-layered Rainbow defined over non-commutative rings
• Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power
• Title not available (Why is that?)
• A Security Analysis of Uniformly-Layered Rainbow

This page was built for publication: Solving Bivariate Quadratic Congruences in Random Polynomial Time

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