Pages that link to "Item:Q2096516"
From MaRDI portal
The following pages link to Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516):
Displaying 4 items.
- New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain (Q6492517) (← links)
