Square Roots

Adolf Kunerth’s algorithm for computing modular square roots and solving general quadratic Diophantine equations transforms discrete modular arithmetic problems into Diophantine equations seeking integer points on parabolic curves; despite Wikipedia’s 2024 deletion citing non-notability and incomprehensibility based solely on Dickson’s summary, the algorithm merits preservation as the only known method avoiding direct factorization through coefficient based descent rather than group theoretic properties.