Source: wikibot/tonelli-shanks-algorithm
= Tonelli–Shanks algorithm
{wiki=Tonelli–Shanks_algorithm}
The Tonelli–Shanks algorithm is a method used to compute square roots in finite fields, particularly useful for finding square roots of a number modulo a prime. This algorithm is significant in number theory and has applications in cryptography, especially in schemes dealing with quadratic residues.