Results 1  10
of
10
Algorithms in algebraic number theory
 Bull. Amer. Math. Soc
, 1992
"... Abstract. In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to ..."
Abstract

Cited by 53 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has been done and, more importantly, what remains to be done in the area. We hope to show that the study of algorithms not only increases our understanding of algebraic number fields but also stimulates our curiosity about them. The discussion is concentrated of three topics: the determination of Galois groups, the determination of the ring of integers of an algebraic number field, and the computation of the group of units and the class group of that ring of integers. 1.
Open Problems in Number Theoretic Complexity, II
"... this paper contains a list of 36 open problems in numbertheoretic complexity. We expect that none of these problems are easy; we are sure that many of them are hard. This list of problems reflects our own interests and should not be viewed as definitive. As the field changes and becomes deeper, new ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
this paper contains a list of 36 open problems in numbertheoretic complexity. We expect that none of these problems are easy; we are sure that many of them are hard. This list of problems reflects our own interests and should not be viewed as definitive. As the field changes and becomes deeper, new problems will emerge and old problems will lose favor. Ideally there will be other `open problems' papers in future ANTS proceedings to help guide the field. It is likely that some of the problems presented here will remain open for the forseeable future. However, it is possible in some cases to make progress by solving subproblems, or by establishing reductions between problems, or by settling problems under the assumption of one or more well known hypotheses (e.g. the various extended Riemann hypotheses, NP 6= P; NP 6= coNP). For the sake of clarity we have often chosen to state a specific version of a problem rather than a general one. For example, questions about the integers modulo a prime often have natural generalizations to arbitrary finite fields, to arbitrary cyclic groups, or to problems with a composite modulus. Questions about the integers often have natural generalizations to the ring of integers in an algebraic number field, and questions about elliptic curves often generalize to arbitrary curves or abelian varieties. The problems presented here arose from many different places and times. To those whose research has generated these problems or has contributed to our present understanding of them but to whom inadequate acknowledgement is given here, we apologize. Our list of open problems is derived from an earlier `open problems' paper we wrote in 1986 [AM86]. When we wrote the first version of this paper, we feared that the problems presented were so difficult...
Using number fields to compute logarithms in finite fields
 Math. Comp
"... Abstract. We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted to finite fields of an arbitrary but fixed degree, is Lq[1/3; (64/9) 1/3 + o(1)], where q is the cardinality o ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Abstract. We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted to finite fields of an arbitrary but fixed degree, is Lq[1/3; (64/9) 1/3 + o(1)], where q is the cardinality of the field, Lq[s; c] =exp(c(log q) s (log log q) 1−s), and the o(1) is for q →∞.Thenumber field sieve factoring algorithm is conjectured to factor a number the size of q inthesameamountoftime. 1.
On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems
, 2007
"... We show deterministic polynomial time algorithms over some family of finite fields for solving univariate polynomial equations and some related problems such as taking nth roots, constructing nth nonresidues, constructing primitive elements and computing elliptic curve “nth roots”. In additional, we ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
We show deterministic polynomial time algorithms over some family of finite fields for solving univariate polynomial equations and some related problems such as taking nth roots, constructing nth nonresidues, constructing primitive elements and computing elliptic curve “nth roots”. In additional, we present a deterministic polynomial time primality test for some family of integers. All algorithms can be proved by elementary means (without assuming any unproven hypothesis). The problem of solving polynomial equations over finite fields is a generalization of the following problems over finite fields • constructing primitive nth roots of unity, • taking nth roots, • constructing nth nonresidues, • constructing primitive elements (generators of the multiplicative group) for any positive n dividing the number of elements of the underlying field. By the TonelliShanks square root algorithm [21, 19] and its generalization for taking nth roots, constructing nth nonresidues
On Taking Square Roots without Quadratic Nonresidues over Finite Fields
, 2009
"... We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary. In some cases, the square root algorithm runs in Õ(log2 q) bit operations over f ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary. In some cases, the square root algorithm runs in Õ(log2 q) bit operations over finite fields with q elements. As an application, we construct a deterministic primality proving algorithm, which runs in Õ(log3 N) for some integers N. 1
Approximate constructions in finite fields
 Proc. 3rd Conf. on Finite Fields and Appl
, 1995
"... ..."
(Show Context)
On taking square roots and constructing quadratic nonresidues over finite fields
, 2007
"... We present a novel idea to compute square roots over some families of finite fields. Our algorithms are deterministic polynomial time and can be proved by elementary means (without assuming any unproven hypothesis). In some particular finite fields Fq, there are algorithms for taking square roots wi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We present a novel idea to compute square roots over some families of finite fields. Our algorithms are deterministic polynomial time and can be proved by elementary means (without assuming any unproven hypothesis). In some particular finite fields Fq, there are algorithms for taking square roots with Õ(log2 q) bit operations. As an application of our square root algorithms, we show a deterministic primality testing algorithm for some form of numbers. For some positive integer N, this primality testing algorithm runs in Õ(log3 N).
Algorithmic Number Theory MSRI Publications
"... The impact of the number field sieve on the discrete logarithm problem in finite fields ..."
Abstract
 Add to MetaCart
The impact of the number field sieve on the discrete logarithm problem in finite fields