Abstract We present a new deterministic algorithm for the problem of constructing kth power nonresidues in finite fields F p n, where p is prime and k is a prime divisor of p n
|
200
|
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance
– Pohlig, Hellman
- 1978
|
|
56
|
Subquadratic-time factoring of polynomials over finite fields
– Kaltofen, Shoup
- 1998
|
|
47
|
New algorithms for finding irreducible polynomials over finite fields
– Shoup
- 1990
|
|
42
|
Improved algorithms for integer programming and related problems
– Kannan
- 1983
|
|
38
|
The fundamental theorem of algebra in terms of computational complexity
– Schönhage
- 1982
|
|
32
|
Explicit bounds for primality testing and related problems
– Bach
- 1990
|
|
28
|
Searching for primitive roots in finite fields
– Shoup
- 1992
|
|
25
|
Factoring with cyclotomic polynomials
– Bach, Shallit
- 1989
|
|
23
|
Algorithms in algebraic number theory
– Lenstra
- 1992
|
|
20
|
On taking roots in finite fields
– Adleman, Manders, et al.
- 1977
|
|
19
|
The least quadratic nonresidue
– Ankeny
- 1952
|
|
15
|
Algebraic Number Fields
– Janusz
- 1973
|
|
15
|
Finding isomorphisms between finite fields
– Lenstra
- 1991
|
|
10
|
On the computation of units and class numbers by a generalization of Lagrange’s algorithm
– Buchmann
- 1987
|
|
10
|
Riemann hypothesis and finding roots over finite fields
– Huang
- 1985
|
|
9
|
A bound for the least prime ideal in the Chebotarev density theorem
– Lagarias, Montgomery, et al.
- 1979
|
|
6
|
On the period length of the generalized Lagrange algorithm
– Buchmann
- 1987
|
|
6
|
zur Gathen. Factoring polynomials and primitive elements for special primes
– von
- 1987
|
|
6
|
On the least primitive root of a prime
– Wang
- 1961
|
|
6
|
On construction of primitive elements and primitive normal bases in a finite field
– Shparlinski, Stepanov
- 1989
|
|
5
|
Factoring a solvable polynomial over a finite field and Generalized Riemann Hypothesis
– Evdokimov
- 1989
|
|
5
|
On the distribution of primitive roots in finite fields
– Perel'muter, Shparlinsky
- 1990
|
|
4
|
Lenstra Jr. Finding irreducible polynomials over finite fields
– Adleman, W
- 1986
|
|
4
|
Factoring polynomials over finite fields
– R'onyai
- 1988
|
|
3
|
zur Gathen. Deterministic factorization of polynomials over special finite fields
– Bach, von
- 1988
|
|
3
|
Galois groups and factoring polynomials over finite fields
– R'onyai
- 1989
|
|
3
|
On the least primitive root of a prime,” Scientia Sinica 10
– Wang
- 1961
|
|
2
|
On principal ideal testing in algebraic number fields
– Buchmann, Williams
- 1987
|
|
2
|
Removing randomness from computational number theory (Ph
– Shoup
- 1989
|
|
1
|
Perel ′ muter and
– I
- 1990
|
|
1
|
Computing maximal orders and decomposing primes in number fields
– Buchmann, Lenstra
|
|
