Taking Roots over High Extensions of Finite Fields

by Javad Doliskani , Éric Schost

Datum	Value	Source
TITLE	Taking Roots over High Extensions of Finite Fields	SVM HeaderParse 0.2
AUTHOR NAME	Javad Doliskani	SVM HeaderParse 0.2
AUTHOR NAME	Éric Schost	SVM HeaderParse 0.2
ABSTRACT	We present a new algorithm for computing m-th roots over the finite field Fq, where q = p n, with p a prime, and m any positive integer. In the particular case m = 2, the cost of the new algorithm is an expected O(M(n) log(p) + C(n) log(n)) operations in Fp, where M(n) and C(n) are bounds for the cost of polynomial multiplication and modular polynomial composition. Known results give M(n) = O(n log(n) log log(n)) and C(n) = O(n 1.67), so our algorithm is subquadratic in n.	SVM HeaderParse 0.2
CITATIONS	23 found	ParsCit 1.0