Abstract
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the simplest model. Explicit formulas defining reduced divisors for some particular cases are found. The reduced divisors are obtained in the form of solution of the Jacobi inversion problem which provides the way of computing Abelian functions on arbitrary non-special divisors. An effective reduction algorithm is proposed, which has the advantage that it involves only arithmetic operations on polynomials. The proposed addition algorithm contains more details comparing with the known in cryptography, and is extended to divisors of arbitrary degrees comparing with the known in the theory of hyperelliptic functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Symmetry, Integrability and Geometry: Methods and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
