The following pages link to (Q4273680):
Displaying 22 items.
- The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
- A pentagonal number sieve (Q1268625) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- Lattice sieving in three dimensions for discrete log in medium characteristic (Q2033517) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- An Implementation of the Number Field Sieve (Q2785383) (← links)
- Better polynomials for GNFS (Q2792346) (← links)
- Strategy of Relations Collection in Factoring RSA Modulus (Q2801769) (← links)
- An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$ (Q3121357) (← links)
- (Q3712686) (← links)
- The stokes sieve problem (Q3790810) (← links)
- A classification of ECM-friendly families of elliptic curves using modular curves (Q5070546) (← links)
- Оценки количества чисел со специальным разложением на простые множители (Q5152417) (← links)
- Robust Estimation in Binary Choice Models (Q5190602) (← links)
- Root optimization of polynomials in the number field sieve (Q5264135) (← links)
- The affine sieve (Q5326491) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)
- We are on the same side. Alternative sieving strategies for the number field sieve (Q6604871) (← links)
