Pages that link to "Item:Q2785383"
From MaRDI portal
The following pages link to An Implementation of the Number Field Sieve (Q2785383):
Displaying 10 items.
- Non-linear polynomial selection for the number field sieve (Q412202) (← links)
- Topics in computational algebraic number theory (Q558179) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- Square Root Algorithms for the Number Field Sieve (Q3166983) (← links)
- On polynomial selection for the general number field sieve (Q3420245) (← links)
- Factorization of the tenth Fermat number (Q4221993) (← links)
- Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus (Q4707308) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- On the coefficients of the polynomial in the number field sieve (Q5046489) (← links)
