First Page | Document Content | |
---|---|---|
![]() Date: 2011-11-11 00:09:18Mathematics Algebra Abstract algebra Polynomials Computer algebra Finite fields Modular arithmetic Binary operations TonelliShanks algorithm Root of unity Time complexity Multiplication algorithm | Add to Reading List |
![]() | Taking Roots over High Extensions of Finite Fields ´ Eric SchostDocID: 1r551 - View Document |
![]() | 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 sqDocID: 1oo9G - View Document |