On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications

Details On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications

2011-05-30

arxiv.org/abs/1105.5852v1

Mathematics

Number Theory

28 pages

Scientific paper

We first show a deterministic algorithm for taking $r$-th roots over $\F_q$ without being given any $r$-th nonresidue, where $\F_q$ is a finite field with $q$ elements and $r$ is a small prime such that $r^2$ divides of $q-1$. As applications, we illustrate deterministic algorithms over $\F_q$ for constructing $r$-th nonresidues, constructing primitive elements, solving polynomial equations and computing elliptic curve "$n$-th roots", and a deterministic primality test for the generalized Proth numbers. All algorithms are proved without assuming any unproven hypothesis. They are efficient only if all the factors of $q-1$ are small and some primitive roots of unity can be constructed efficiently over $\F_q$. In some cases, they are the fastest among the known deterministic algorithms.

Affiliated with

Also associated with

No associations

Rating

On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Taking r-th Roots without r-th Nonresidues over Finite Fields and Its Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-677330