Tonelli–Shanks algorithm

#	Item
1	The Tonelli-Shanks algorithm Ren´e Schoof, Roma 20 dicembre 2008 let p > 2 be prime. We describe an algorithm (due to A. Tonelli (Atti Accad. Linceiand D. Shanks (1970ies)) to compute a square root of a given sq Add to Reading List Source URL: www.mat.uniroma2.it Language: English - Date: 2009-01-31 17:59:10 Algebraic number theory Modular arithmetic TonelliShanks algorithm Field theory Cyclotomic unit Trigonometry in Galois fields
2	1 Square root computation over even extension fields Gora Adj 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-07-18 17:22:53 Modular arithmetic Quadratic residue Field theory Exponentials Tonelli–Shanks algorithm Exponentiation by squaring Polynomial basis Quadratic reciprocity Finite field Abstract algebra Mathematics Number theory
3 $Elementary mathematics / Euclidean algorithm / Integer / Tonelli–Shanks algorithm / Algorithm / Continued fraction / Mathematics / Abstract algebra / Number theory$	ON SHANKS’ ALGORITHM FOR COMPUTING THE CONTINUED FRACTION OF logb a. TERENCE JACKSON AND KEITH MATTHEWS Abstract. We give a more practical variant of Shanks’ 1954 algorithm for computing the continued fraction of log Add to Reading List Source URL: www.numbertheory.org Language: English - Date: 2002-12-04 15:22:13 Elementary mathematics Euclidean algorithm Integer Tonelli–Shanks algorithm Algorithm Continued fraction Mathematics Abstract algebra Number theory