Sciweavers

6 search results - page 1 / 2
» Computing discrete logarithms in high-genus hyperelliptic Ja...
Sort
View
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
JOC
2011
81views more  JOC 2011»
12 years 11 months ago
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...
Andreas Enge, Pierrick Gaudry, Emmanuel Thom&eacut...
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
ASIACRYPT
2000
Springer
13 years 9 months ago
Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
Jinhui Chao, Kazuto Matsuo, Hiroto Kawashiro, Shig...