Results 1 
7 of
7
Taking Roots over High Extensions of Finite Fields
"... We present a new algorithm for computing mth 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 co ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We present a new algorithm for computing mth 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.
New cube root algorithm based on third order linear recurrence relation in finite field, preprint, available from http://eprint.iacr
"... In this paper, we present a new cube root algorithm in finite field Fq with q a power of prime, which extends the CipollaLehmer type algorithms [4, 5]. Our cube root method is inspired by the work of Müller [8] on quadratic case. For given cubic residue c ∈ Fq with q ≡ 1 (mod 9), we show that there ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
In this paper, we present a new cube root algorithm in finite field Fq with q a power of prime, which extends the CipollaLehmer type algorithms [4, 5]. Our cube root method is inspired by the work of Müller [8] on quadratic case. For given cubic residue c ∈ Fq with q ≡ 1 (mod 9), we show that there is an irreducible polynomial f(x) = x 3 − ax 2 + bx − 1 with root α ∈ Fq3 efficient cube root algorithm based on third order linear recurrence sequence arising from f(x). Complexity estimation shows that our algorithm is better than previously proposed CipollaLehmer type algorithms. such that T r(α q2 +q−2 9) is a cube root of c. Consequently we find an
Trace Expression of rth Root over Finite Field Email:
"... Efficient computation of rth root in Fq has many applications in computational number theory and many other related areas. We present a new rth root formula which generalizes Müller’s result on square root, and which provides a possible improvement of the CipollaLehmer type algorithms for general ..."
Abstract
 Add to MetaCart
(Show Context)
Efficient computation of rth root in Fq has many applications in computational number theory and many other related areas. We present a new rth root formula which generalizes Müller’s result on square root, and which provides a possible improvement of the CipollaLehmer type algorithms for general case. More precisely, for given rth power c ∈ Fq, we show that there exists α ∈ Fqr ( such that T r α (∑r−1 i=0 qi)−r r2)r = c where T r(α) = α + αq + αq2 + · · · + αqr−1 and α is a root of certain irreducible polynomial of degree r over Fq.
Square Root Algorithm in Fq for q ≡ 2 s + 1 (mod 2 s+1)
"... We present a square root algorithm in Fq which generalizes Atkins’s square root algorithm [6] for q ≡ 5 (mod 8) and Kong et al.’s algorithm [8] for q ≡ 9 (mod 16). Our algorithm precomputes a primitive 2 sth root of unity ξ where s is the largest positive integer satisfying 2 s q − 1, and is appli ..."
Abstract
 Add to MetaCart
(Show Context)
We present a square root algorithm in Fq which generalizes Atkins’s square root algorithm [6] for q ≡ 5 (mod 8) and Kong et al.’s algorithm [8] for q ≡ 9 (mod 16). Our algorithm precomputes a primitive 2 sth root of unity ξ where s is the largest positive integer satisfying 2 s q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for square root computation and is favorably compared with the algorithms of Atkin, Müller and Kong et al.
On rth Root Extraction Algorithm in Fq For q ≡ lr s + 1 (mod r s+1) with 0 < l < r and Small s
"... We present an rth root extraction algorithm over a finite field Fq. Our algorithm precomputes a primitive r sth root of unity ξ where s is the largest positive integer satisfying r s q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for the ..."
Abstract
 Add to MetaCart
(Show Context)
We present an rth root extraction algorithm over a finite field Fq. Our algorithm precomputes a primitive r sth root of unity ξ where s is the largest positive integer satisfying r s q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for the rth root computation and is favorably compared to the existing algorithms.
IOS Press A Complete Generalization of Atkin’s Square Root Algorithm
"... Abstract. Atkin’s algorithm [2] for computing square roots in Z∗ p, where p is a prime such that p ≡ 5mod 8, has been extended by Müller [15] for the case p ≡ 9mod 16. In this paper we extend Atkin’s algorithm to the general case p ≡ 2s+1mod 2s+1, for any s ≥ 2, thus providing a complete solution f ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Atkin’s algorithm [2] for computing square roots in Z∗ p, where p is a prime such that p ≡ 5mod 8, has been extended by Müller [15] for the case p ≡ 9mod 16. In this paper we extend Atkin’s algorithm to the general case p ≡ 2s+1mod 2s+1, for any s ≥ 2, thus providing a complete solution for the case p ≡ 1 mod 4. Complexity analysis and comparisons with other methods are also provided.