Results 1  10
of
28
Searching for Primitive Roots in Finite Fields
, 1992
"... Let GF(p n ) be the finite field with p n elements where p is prime. We consider the problem of how to deterministically generate in polynomial time a subset of GF(p n ) that contains a primitive root, i.e., an element that generates the multiplicative group of nonzero elements in GF(p n ). ..."
Abstract

Cited by 51 (3 self)
 Add to MetaCart
Let GF(p n ) be the finite field with p n elements where p is prime. We consider the problem of how to deterministically generate in polynomial time a subset of GF(p n ) that contains a primitive root, i.e., an element that generates the multiplicative group of nonzero elements in GF(p n ). We present three results. First, we present a solution to this problem for the case where p is small, i.e., p = n O(1) . Second, we present a solution to this problem under the assumption of the Extended Riemann Hypothesis (ERH) for the case where p is large and n = 2. Third, we give a quantitative improvement of a theorem of Wang on the least primitive root for GF(p) assuming the ERH. Appeared in Mathematics of Computation 58, pp. 369380, 1992. An earlier version of this paper appeared in the 22nd Annual ACM Symposium on Theory of Computing (1990), pp. 546554. 1980 Mathematics Subject Classification (1985 revision): 11T06. 1. Introduction Consider the problem of finding a primitive ...
On the function field sieve and the impact of higher splitting probabilities: Application to discrete logarithms in f 2
"... In this paper we propose a binary field variant of the JouxLercier mediumsized Function Field Sieve, which results not only in complexities as low as Lqn(1/3, 2/3) for computing arbitrary logarithms, but also in an heuristic polynomial time algorithm for finding the discrete logarithms of degree ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
(Show Context)
In this paper we propose a binary field variant of the JouxLercier mediumsized Function Field Sieve, which results not only in complexities as low as Lqn(1/3, 2/3) for computing arbitrary logarithms, but also in an heuristic polynomial time algorithm for finding the discrete logarithms of degree one elements. To illustrate the efficiency of the method, we have successfully solved the DLP in the finite field with 2 1971 elements.
Normal Bases over Finite Fields
, 1993
"... Interest in normal bases over finite fields stems both from mathematical theory and practical applications. There has been a lot of literature dealing with various properties of normal bases (for finite fields and for Galois extension of arbitrary fields). The advantage of using normal bases to repr ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
(Show Context)
Interest in normal bases over finite fields stems both from mathematical theory and practical applications. There has been a lot of literature dealing with various properties of normal bases (for finite fields and for Galois extension of arbitrary fields). The advantage of using normal bases to represent finite fields was noted by Hensel in 1888. With the introduction of optimal normal bases, large finite fields, that can be used in secure and e#cient implementation of several cryptosystems, have recently been realized in hardware. The present thesis studies various theoretical and practical aspects of normal bases in finite fields. We first give some characterizations of normal bases. Then by using linear algebra, we prove that F q n has a basis over F q such that any element in F q represented in this basis generates a normal basis if and only if some groups of coordinates are not simultaneously zero. We show how to construct an irreducible polynomial of degree 2 n with linearly i...
Constructing nonresidues in finite fields and the extended Riemann hypothesis
 Math. Comp
, 1991
"... Abstract. We present a new deterministic algorithm for the problem of constructing kth power nonresidues in finite fields Fpn,wherepis prime and k is a prime divisor of pn −1. We prove under the assumption of the Extended Riemann Hypothesis (ERH), that for fixed n and p →∞, our algorithm runs in pol ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We present a new deterministic algorithm for the problem of constructing kth power nonresidues in finite fields Fpn,wherepis prime and k is a prime divisor of pn −1. We prove under the assumption of the Extended Riemann Hypothesis (ERH), that for fixed n and p →∞, our algorithm runs in polynomial time. Unlike other deterministic algorithms for this problem, this polynomialtime bound holds even if k is exponentially large. More generally, assuming the ERH, in time (n log p) O(n) we can construct a set of elements
Explicit Construction of SelfDual Integral Normal Bases for the SquareRoot of the Inverse Different
 J. Number Theory, 129:1773
"... ar ..."
(Show Context)
BlackBox Extension Fields and the Inexistence of FieldHomomorphic OneWay Permutations
"... The blackbox field (BBF) extraction problem is, for a given field�, to determine a secret field element hidden in a blackbox which allows to add and multiply values in�in the box and which reports only equalities of elements in the box. This problem is of cryptographic interest for two reasons. Fi ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
(Show Context)
The blackbox field (BBF) extraction problem is, for a given field�, to determine a secret field element hidden in a blackbox which allows to add and multiply values in�in the box and which reports only equalities of elements in the box. This problem is of cryptographic interest for two reasons. First, for ���Ôit corresponds to the generic reduction of the discrete logarithm problem to the computational DiffieHellman problem in a group of prime orderÔ. Second, an efficient solution to the BBF problem proves the inexistence of certain fieldhomomorphic encryption schemes whose realization is an interesting open problems in algebrabased cryptography. BBFs are also of independent interest in computational algebra. In the previous literature, BBFs had only been considered for the prime field case. In this paper we consider a generalization of the extraction problem to BBFs that are extension fields. More precisely we discuss the representation problem defined as follows: For given generators��������algebraically generating a BBF and an additional elementÜ, all hidden in a blackbox, expressÜalgebraically in terms of ��������. We give an efficient algorithm for this representation problem and related problems for fields with small characteristic (e.g.���Òfor someÒ). We also consider extension fields of large characteristic and show how to reduce the representation problem to the extraction problem for the underlying prime field. These results imply the inexistence of fieldhomomorphic (as opposed to only grouphomomorphic, like RSA) oneway permutations for fields of small characteristic.
Solving a 6120bit DLP on a Desktop Computer
"... In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. In particular, we demonstrate a practical DLP break in the finite field of 2 6120 ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. In particular, we demonstrate a practical DLP break in the finite field of 2 6120 elements, using just a single coremonth.
Constructing Normal Bases in Finite Fields
 J. Symbolic Comput
, 1990
"... This paper addresses the question: how can we find a normal element efficiently? More generally, we consider how to find an element of any given additive order. Hensel (1888) pioneered the study of normal bases for finite fields and proved that they always exist. We use his algorithm in Section 2. E ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper addresses the question: how can we find a normal element efficiently? More generally, we consider how to find an element of any given additive order. Hensel (1888) pioneered the study of normal bases for finite fields and proved that they always exist. We use his algorithm in Section 2. Eisenstein (1850) had already noted that normal bases always exist. Hensel, and also Ore (1934), determine exactly the number of these bases, and Ore develops the more general concept of additive order. Ore's approach is developed into more constructive proofs of the normal basis theorem in several textbooks (for example, van der Waerden 1966, Section 67, and Albert 1956, Section 4.15); these all use some linear algebra calculations. Schwarz (1988) has given a new proof along these lines, and several recent papers have translated this approach into algorithms. Sidel'nikov (1988) deals with the case where n divides one of p (the characteristic of F q ), q + 1, or
On the discrete logarithm problem in finite fields of fixed characteristic
"... Abstract. For q a prime power, the discrete logarithm problem (DLP) in F×q consists in finding, for any g ∈ F×q and h ∈ 〈g〉, an integer x such that g x = h. For each prime p we exhibit infinitely many extension fields Fpn for which the DLP in F pn can be solved in expected quasipolynomial time. 1 ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Abstract. For q a prime power, the discrete logarithm problem (DLP) in F×q consists in finding, for any g ∈ F×q and h ∈ 〈g〉, an integer x such that g x = h. For each prime p we exhibit infinitely many extension fields Fpn for which the DLP in F pn can be solved in expected quasipolynomial time. 1
Communication Complexity of Key Agreement on Limited Ranges (Extended Abstract)
, 1994
"... This paper studies a variation on classical keyagreement and consensus problems in which the set S of possible keys is the range of a random variable that can be sampled. We give tight upper and lower bounds of dlog 2 ke bits on the communication complexity of agreement on some key in S, using a fo ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper studies a variation on classical keyagreement and consensus problems in which the set S of possible keys is the range of a random variable that can be sampled. We give tight upper and lower bounds of dlog 2 ke bits on the communication complexity of agreement on some key in S, using a form of Sperner's Lemma, and give bounds on other problems. In the case where keys are generated by a probabilistic polynomialtime Turing machine, agreement is shown to be possible with zero communication if every fully polynomialtime approximation scheme (fpras) has a certain symmetrybreaking property. 1 Introduction A fundamental problem in key agreement between two parties, commonly called "Alice" and "Bob," is for Alice to communicate some string w to Bob over an expensive, noisy, and/or insecure channel. Most work allows w to be any given string, making no assumptions about its source, or considers w to be uniformly generated among strings of some length n. We study cases in which w...