Results 1 
3 of
3
Discrete logarithms in gf(p) using the number field sieve
 SIAM J. Discrete Math
, 1993
"... Recently, several algorithms using number field sieves have been given to factor a number n in heuristic expected time Ln[1/3; c], where Ln[v; c] = exp{(c + o(1))(log n) v (log log n) 1−v}, for n → ∞. In this paper we present an algorithm to solve the discrete logarithm problem for GF (p) with heur ..."
Abstract

Cited by 63 (1 self)
 Add to MetaCart
Recently, several algorithms using number field sieves have been given to factor a number n in heuristic expected time Ln[1/3; c], where Ln[v; c] = exp{(c + o(1))(log n) v (log log n) 1−v}, for n → ∞. In this paper we present an algorithm to solve the discrete logarithm problem for GF (p) with heuristic expected running time Lp[1/3; 3 2/3]. For numbers of a special form, there is an asymptotically slower but more practical version of the algorithm.
Bounds For Fixed Point Free Elements In A Transitive Group and Applications to Curves over Finite Fields
 255–287, MR 1484879 (98j:12002), Zbl 0910.11053
, 1997
"... this paper, we are interested in upper bounds for V f . It is clear that V f q with equality holding if and only if f(T ) is a permutation polynomial over F q . If V f ! q, then ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
this paper, we are interested in upper bounds for V f . It is clear that V f q with equality holding if and only if f(T ) is a permutation polynomial over F q . If V f ! q, then
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
 Experiment. Math
, 1992
"... this paper we describe a heuristic method for obtaining linear dependencies among the rows of such matrices. In addition, we present data from experimental runs with randomly generated square matrices of size 50,000 and 100,000. ..."
Abstract
 Add to MetaCart
this paper we describe a heuristic method for obtaining linear dependencies among the rows of such matrices. In addition, we present data from experimental runs with randomly generated square matrices of size 50,000 and 100,000.