Sciweavers

4 search results - page 1 / 1
» An algorithm for evaluation of discrete logarithms in some n...
Sort
View
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
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
EUROCRYPT
2006
Springer
13 years 8 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
ASIACRYPT
2000
Springer
13 years 9 months ago
Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
Seigo Arita