Analysis of Algorithms for Computing in Jacobian of a Picard Curve
In this article a representation of the elements of the Jacobian of a Picard curve is considered, which allows us to construct an algorithm for the reduction of divisors with complexity O(deg(D)). Addition of divisors can be performed using the reduction algorithm.
1. Barreirol E. R., Sarlabous J. E., Cherdieu J.-P. Efficient Reduction on the Jacobian Variety of Picard Curves // Coding Theory, Cryptography ...
Acceleration of Computations in Jacobian Hyperelliptic Curve
... облачных вычислений // Информационные технологии. 2013. № 9. С. 36—39.
Aleshnikova M. V., Aleshnikov S. I., Gorbachev A. A., Olefirenko D. O.
hyperelliptic curve, Jacobian, addition and doubling of divisors, Miller‘s algorithm, projective coordinates
13-20