Factorization with genus 2 curves
From MaRDI portal
Publication:3584826
DOI10.1090/S0025-5718-09-02295-9zbMath1227.11123arXiv0905.2325WikidataQ56139870 ScholiaQ56139870MaRDI QIDQ3584826
Publication date: 30 August 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.2325
Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Factorization (11Y05)
Related Items (11)
Fast cryptography in genus 2 ⋮ On the statistical leak of the GGH13 multilinear map and some variants ⋮ Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields ⋮ Factoring integers and oracles for elliptic and hyperelliptic curves ⋮ Group arithmetic in \(C_{3,5}\) curves ⋮ Computing supersingular isogenies on Kummer surfaces ⋮ ECM using Edwards curves ⋮ Kummer for genus one over prime-order fields ⋮ Genus Two Curves with Many Elliptic Subcovers ⋮ Constructing abelian surfaces for cryptography via Rosenhain invariants ⋮ Hyper-and-elliptic-curve cryptography
Cites Work
- Unnamed Item
- Factoring integers with elliptic curves
- Tata lectures on theta. I: Introduction and motivation: Theta functions in one variable. Basic results on theta functions in several variables. With the assistance of C. Musili, M. Nori, E. Previato, and M. Stillman
- Improving the arithmetic of elliptic curves in the Jacobi model
- Genus two curves covering elliptic curves: a computational approach
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Equations for the Jacobian of a hyperelliptic curve
- ECM using Edwards curves
- Fast genus 2 arithmetic based on Theta functions
- Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura
- Algorithmic Number Theory
This page was built for publication: Factorization with genus 2 curves
