Integer factoring problem and elliptic curves over the ring Z_n
From MaRDI portal
Publication:5215934
Recommendations
- Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n
- Some computational problems of cryptographic significance concerning elliptic curves over rings
- Factoring integers with elliptic curves
- scientific article; zbMATH DE number 3959522
- Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)
Cited in
(14)- Jacobians of hyperelliptic curves over \(\mathbb{Z}_{n}\) and factorization of \(n\)
- Factoring integers with elliptic curves
- Elliptic curve and integer factorization
- On oracle factoring of integers
- Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)
- Factoring Numbers with elliptic curves
- Factoring integers and oracles for elliptic and hyperelliptic curves
- Factorization, malleability and equivalent problems
- Smooth factors of integers and elliptic curve based factoring with an oracle
- scientific article; zbMATH DE number 653578 (Why is no real title available?)
- Some computational problems of cryptographic significance concerning elliptic curves over rings
- Factoring \(n\) and the number of points of Kummer hypersurfaces \(\bmod n\)
- Irreducible Factorization Lengths and the Elasticity Problem within ℕ
- scientific article; zbMATH DE number 2086906 (Why is no real title available?)
This page was built for publication: Integer factoring problem and elliptic curves over the ring \(\mathbb Z_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215934)
