TonelliShanks algorithm

#	Item
1	Taking Roots over High Extensions of Finite Fields ´ Eric Schost Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2011-11-11 00:09:18 Mathematics Algebra Abstract algebra Polynomials Computer algebra Finite fields Modular arithmetic Binary operations TonelliShanks algorithm Root of unity Time complexity Multiplication algorithm
2	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