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.

• Type: Conference
• Year: 2006
• Where: DCC
• Authors: Paulo S. L. M. Barreto, José Felipe Voloch
• Keywords: Certain Choices, Computer Graphics, DCC 2006