47 search results - page 1 / 10 » Solving a 676-Bit Discrete Logarithm Problem in GF(36n) |
PKC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
PKC
2010
Springer
13 years 3 months ago
2010
Springer
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
ANTS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
INDOCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm pr...