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

TL;DR

This paper presents a deterministic algorithm for extracting r-th roots in finite fields without prior nonresidue knowledge, enabling various cryptographic and number-theoretic applications efficiently under certain conditions.

Contribution

It introduces a novel deterministic method for r-th root extraction over finite fields without needing r-th nonresidues, expanding capabilities for cryptographic algorithms.

Findings

Efficient deterministic algorithms for constructing r-th nonresidues

Methods for constructing primitive elements and solving polynomial equations

A deterministic primality test for generalized Proth numbers

Abstract

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.