Faster cofactorization with ECM using mixed representations
From MaRDI portal
Publication:2055704
DOI10.1007/978-3-030-45388-6_17zbMath1483.11264OpenAlexW3023398280MaRDI QIDQ2055704
Publication date: 1 December 2021
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02613652/file/2018-669.pdf
elliptic curve methodtwisted Edwards curveMontgomery curveCADO-NFScofactorizationdouble-base representation
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Factorization (11Y05)
Related Items
A classification of ECM-friendly families of elliptic curves using modular curves, Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation, Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation, Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Cites Work
- Unnamed Item
- The development of the number field sieve
- Factoring integers with elliptic curves
- A complete set of addition laws for incomplete Edwards curves
- Finding ECM-friendly curves through a study of Galois properties
- Twisted Edwards Curves
- Factorization of a 768-Bit RSA Modulus
- Starfish on Strike
- Twisted Edwards Curves Revisited
- Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- On the Evaluation of Powers
- Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM
- ECM at Work
- ECM using Edwards curves
- A normal form for elliptic curves
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
- Algorithmic Number Theory