Solving Bivariate Quadratic Congruences in Random Polynomial Time

DOI10.2307/2007870MaRDI QIDQ3758905zbMATH OpenOpenAlexFDO

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

Publication date 1987

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

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)

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

Cited in

(11)

• scientific article; zbMATH DE number 3879003 (Why is no real title available?)
• scientific article; zbMATH DE number 89759 (Why is no real title available?)
• Solving quadratic equations using reduced unimodular quadratic forms
• Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power
• Splitting quaternion algebras over quadratic number fields
• A security analysis of uniformly-layered Rainbow defined over non-commutative rings
• Randomized algorithms in number theory
• On the number of solutions of the equation \(Rx^2 + Sy^2\equiv 1\pmod N\)
• Cryptography Based on Quadratic Forms: Complexity Considerations
• Efficient solution of rational conics
• A security analysis of uniformly-layered Rainbow. Revisiting Sato-Araki's non-commutative approach to Ong-Schnorr-Shamir signature towards postquantum paradigm

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)