Hyperelliptic curves and integer factorization

DOI10.4064/CM9490-8-2025MaRDI QIDQ6847977zbMATH OpenFDO

Authors Robert Dryło, Jacek Pomykała

Publication date 6 March 2026

Published in Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/CM9490-8-2025

zbMATH Keywords

hyperelliptic curvesinteger factorizationPicard group

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Special algebraic curves and curves of low genus (14H45) Elliptic curves (14H52) Computational aspects of algebraic curves (14Q05)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Computing in the Jacobian of a Hyperelliptic Curve
• Computing the order of points on an elliptic curve modulo N is as difficult as factoring N
• Deterministic factoring with oracles
• Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
• Elliptic Curves and Primality Proving
• Elliptic curves. Number theory and cryptography
• Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n
• Factoring integers and oracles for elliptic and hyperelliptic curves
• Factoring integers with elliptic curves
• Factorization with genus 2 curves
• Hyperelliptic cryptosystems
• Integer factoring problem and elliptic curves over the ring \(\mathbb Z_n\)
• Jacobians of hyperelliptic curves over \(\mathbb{Z}_{n}\) and factorization of \(n\)
• Mathematics of public key cryptography.
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Real and imaginary quadratic representations of hyperelliptic function fields

This page was built for publication: Hyperelliptic curves and integer factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847977)