Pages that link to "Item:Q2311609"
From MaRDI portal
The following pages link to A unified polynomial selection method for the (tower) number field sieve algorithm (Q2311609):
Displaying 4 items.
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- Refined analysis to the extended tower number field sieve (Q2304549) (← links)
- New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields (Q2820492) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)