Pages that link to "Item:Q2055704"
From MaRDI portal
The following pages link to Faster cofactorization with ECM using mixed representations (Q2055704):
Displaying 3 items.
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- A classification of ECM-friendly families of elliptic curves using modular curves (Q5070546) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)
