Pages that link to "Item:Q3420245"
From MaRDI portal
The following pages link to On polynomial selection for the general number field sieve (Q3420245):
Displaying 15 items.
- The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
- Non-linear polynomial selection for the number field sieve (Q412202) (← links)
- Montgomery's method of polynomial selection for the number field sieve (Q745185) (← 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)
- ON NONLINEAR POLYNOMIAL SELECTION AND GEOMETRIC PROGRESSION (MOD N) FOR NUMBER FIELD SIEVE (Q2787639) (← links)
- Better polynomials for GNFS (Q2792346) (← links)
- Some mathematical remarks on the polynomial selection in NFS (Q2826687) (← links)
- Collecting relations for the number field sieve in (Q2971019) (← links)
- An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic (Q3005589) (← links)
- On polynomial selection for the general number field sieve (Q3420245) (← links)
- A new ranking function for polynomial selection in the number field sieve (Q4998643) (← links)
- On the coefficients of the polynomial in the number field sieve (Q5046489) (← links)
- Root optimization of polynomials in the number field sieve (Q5264135) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
