The following pages link to (Q4325965):
Displayed 8 items.
- The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
- Topics in computational algebraic number theory (Q558179) (← links)
- On the computation of Hilbert class fields (Q1265679) (← links)
- Rigorous analysis of a randomised number field sieve (Q1747213) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- A Kilobit Special Number Field Sieve Factorization (Q5387089) (← links)
- When e-th Roots Become Easier Than Factoring (Q5387090) (← links)