On the optimal passing of distinguished points for parallelized Pollard’s rho-method
Problems of development and realization of an efficient parallelized algorithm to solve elliptic curve discrete logarithm problem (ECDLP) based on Pollard’s rho-method in the computational model SPMD using technology of message passing are considered. It is researched how many central processes are needed and what proportion of distinguished points is needed ...
Overview of effective point counting algorithms for Jacobian of hyperelliptic curve over finite field
... of Jacobians of genus two curves with complex multiplication // Ibid.
Arithmetic of generalized Jacobians // Ibid. 2006.
On the security of generalized Jacobian cryptosystems // Ibid.
Galbraith S. D., Smith B. A.
Discrete logarithms in generalized Jacobians // Ibid.
Improvement of th
eriault algorithm of index calculus for Jacobian of hyperelliptic curves of small genus //
Ilyashenko L. D.
hyperelliptic curve, Jacobian, point counting, discrete ...