Higher-dimensional sieving for the number field sieve algorithms

DOI10.2140/OBS.2019.2.275WikidataQ128418094 ScholiaQ128418094MaRDI QIDQ6165871FDOQ6165871

Authors: Laurent Grémy 

Publication date: 2 August 2023

Published in: Open Book Series (Search for Journal in Brave)

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

zbMATH Keywords

discrete logarithmfinite fieldssieve algorithmsmedium characteristic

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• A taxonomy of pairing-friendly elliptic curves
• Title not available (Why is that?)
• On the foundations of linear and integer linear programming I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
• On polynomial selection for the general number field sieve
• Title not available (Why is that?)
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Bounds for resultants of univariate and bivariate polynomials
• Better polynomials for GNFS
• Title not available (Why is that?)
• Theory and Applications of n-Fold Integer Programming
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• A tale of two sieves.
• Updating key size estimations for pairings
• Extended tower number field sieve: a new complexity for the medium prime case
• The Number Field Sieve in the Medium Prime Case
• Discrete logarithms and local units
• Computation of a 768-bit prime field discrete logarithm
• The tower number field sieve
• Computing individual discrete logarithms faster in \(\mathrm{GF}(p^n)\) with the NFS-DL algorithm
• Nearly sparse linear algebra and application to discrete logarithms computations
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
• Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
• Virtual logarithms
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^{12})\)
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• General Purpose Integer Factoring

Cited In (5)

• Title not available (Why is that?)
• 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)