Sciweavers

10 search results - page 1 / 2
» A Subexponential Algorithm for Discrete Logarithms over All ...
Sort
View
CRYPTO
1993
Springer
118views Cryptology» more  CRYPTO 1993»
13 years 9 months ago
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...
Leonard M. Adleman, Jonathan DeMarrais
MOC
2002
121views more  MOC 2002»
13 years 4 months ago
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
Andreas Enge
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
2001
IEEE
14 years 4 months ago
Cryptography in Quadratic Function Fields
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
Renate Scheidler
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
13 years 9 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
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...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan