Sciweavers

561 search results - page 2 / 113
» Using number fields to compute logarithms in finite fields
Sort
View
CORR
2004
Springer
117views Education» more  CORR 2004»
13 years 5 months ago
Efficient dot product over word-size finite fields
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
Jean-Guillaume Dumas
MOC
1998
131views more  MOC 1998»
13 years 4 months ago
An algorithm for evaluation of discrete logarithms in some nonprime finite fields
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
Igor A. Semaev
EUROCRYPT
2006
Springer
13 years 9 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier
MOC
2002
84views more  MOC 2002»
13 years 4 months ago
Smooth ideals in hyperelliptic function fields
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...
Andreas Enge, Andreas Stein
DCC
2002
IEEE
14 years 4 months ago
Polynomial Interpolation of the Discrete Logarithm
Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field Fp by polynomials modulo p and modulo p -1, re...
Arne Winterhof