Sciweavers

DCC
2006
IEEE

Efficient Computation of Roots in Finite Fields

15 years 1 days ago
Efficient Computation of Roots in Finite Fields
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms, which need O(rm3 log3 q) steps.
Paulo S. L. M. Barreto, José Felipe Voloch
Added 25 Dec 2009
Updated 25 Dec 2009
Type Conference
Year 2006
Where DCC
Authors Paulo S. L. M. Barreto, José Felipe Voloch
Comments (0)