Solving Bivariate Quadratic Congruences in Random Polynomial Time

DOI10.2307/2007870zbMath0622.10003OpenAlexW4231440355MaRDI QIDQ3758905

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

Publication date: 1987

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

zbMATH Keywords

binary quadratic formrandomized algorithmbivariate quadratic congruence

Mathematics Subject Classification ID

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

Related Items (4)

Randomized algorithms in number theory ⋮ A security analysis of uniformly-layered Rainbow defined over non-commutative rings ⋮ A Security Analysis of Uniformly-Layered Rainbow ⋮ Cryptography Based on Quadratic Forms: Complexity Considerations

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