Monday, 20.3. at 10:15
Seminar room Altenbergerstrasse 50
The Hyperelliptic Curve Discrete Logarithm Problem.
The security of several important cryptosystems relies on the difficulty of the discrete logarithm problem. The Jacobian of a hyperelliptic curve is a group over which the HCDLP (Hyperelliptic Curve Discrete Logarithm Problem) can be defined. Possible algorithms for HCDLP are Pollard methods and Index Calculus for HC. The Jacobian order should be large enough so that computing the HCDLP becomes infeasible.