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 | Taking Roots over High Extensions of Finite Fields ´ Eric SchostAdd to Reading ListSource URL: www.csd.uwo.caDownload Document from Source WebsiteFile Size: 291,97 KBShare Document on Facebook |