An Implementation of the Number Field Sieve
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 475432 (Why is no real title available?)
- scientific article; zbMATH DE number 475433 (Why is no real title available?)
- scientific article; zbMATH DE number 475434 (Why is no real title available?)
- scientific article; zbMATH DE number 475435 (Why is no real title available?)
- scientific article; zbMATH DE number 3335234 (Why is no real title available?)
- Algebraische Zahlentheorie
- Factoring polynomials with rational coefficients
- Prime numbers and computer methods for factorization
- Solving linear equations over GF(2): Block Lanczos algorithm
- The development of the number field sieve
Cited in
(25)- On a strategy in the sieving procedure for the factorization of large natural numbers
- scientific article; zbMATH DE number 1643927 (Why is no real title available?)
- scientific article; zbMATH DE number 1185143 (Why is no real title available?)
- scientific article; zbMATH DE number 4168803 (Why is no real title available?)
- Non-linear polynomial selection for the number field sieve
- scientific article; zbMATH DE number 1222138 (Why is no real title available?)
- scientific article; zbMATH DE number 475435 (Why is no real title available?)
- scientific article; zbMATH DE number 475436 (Why is no real title available?)
- scientific article; zbMATH DE number 733569 (Why is no real title available?)
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Topics in computational algebraic number theory
- Higher-dimensional sieving for the number field sieve algorithms
- An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over GF(2)
- Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
- Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus
- Factorization of the tenth Fermat number
- scientific article; zbMATH DE number 1303173 (Why is no real title available?)
- Public Key Cryptography - PKC 2006
- On the coefficients of the polynomial in the number field sieve
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Square Root Algorithms for the Number Field Sieve
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Modifications to the number field sieve
- On polynomial selection for the general number field sieve
- scientific article; zbMATH DE number 5532100 (Why is no real title available?)
This page was built for publication: An Implementation of the Number Field Sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785383)