Higher-dimensional sieving for the number field sieve algorithms
From MaRDI portal
Publication:6165871
Recommendations
- Large sieve methods in algebraic number fields
- scientific article; zbMATH DE number 1222138
- scientific article; zbMATH DE number 5654615
- scientific article; zbMATH DE number 3249878
- scientific article; zbMATH DE number 4063217
- The multiple number field sieve for medium- and high-characteristic finite fields
- Some applications of sieve methods in algebraic number fields
- An Implementation of the Number Field Sieve
- scientific article; zbMATH DE number 475436
- On the large sieve method in algebraic number fields
Cites work
- scientific article; zbMATH DE number 435565 (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 1759768 (Why is no real title available?)
- scientific article; zbMATH DE number 3801619 (Why is no real title available?)
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
- A tale of two sieves.
- A taxonomy of pairing-friendly elliptic curves
- Advances in Cryptology - CRYPTO 2003
- An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^{12})\)
- Better polynomials for GNFS
- Bounds for resultants of univariate and bivariate polynomials
- Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- Computation of a 768-bit prime field discrete logarithm
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Computing individual discrete logarithms faster in \(\mathrm{GF}(p^n)\) with the NFS-DL algorithm
- Discrete logarithms and local units
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- Extended tower number field sieve: a new complexity for the medium prime case
- General Purpose Integer Factoring
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- Nearly sparse linear algebra and application to discrete logarithms computations
- New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
- On polynomial selection for the general number field sieve
- On the foundations of linear and integer linear programming I
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- The Number Field Sieve in the Medium Prime Case
- The tower number field sieve
- Theory and Applications of n-Fold Integer Programming
- Updating key size estimations for pairings
- Virtual logarithms
Cited in
(5)- scientific article; zbMATH DE number 1113829 (Why is no real title available?)
- The space complexity analysis in the general number field sieve integer factorization
- Experiments on the Linear Algebra Step in the Number Field Sieve
- Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
This page was built for publication: Higher-dimensional sieving for the number field sieve algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165871)
