scientific article; zbMATH DE number 1113829

MaRDI QIDQ4375601zbMATH OpenFDO

Authors Marije Elkenbracht-Huizing

Publication date 2 November 1998

zbMATH Keywords

factorizationgeneral number field sievemultiple polynomials

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 1222138
• The Multiple Polynomial Quadratic Sieve
• On polynomial selection for the general number field sieve
• The multiple number field sieve with conjugation and generalized Joux-Lercier methods
• Polynomial Selection for the Number Field Sieve
• scientific article; zbMATH DE number 475436
• The multiple number field sieve for medium- and high-characteristic finite fields
• Sieve methods for polynomial rings over finite fields
• scientific article; zbMATH DE number 1444326
• Higher-dimensional sieving for the number field sieve algorithms

Cited in

(8)

• Special prime numbers and discrete logs in finite prime fields
• On nonlinear polynomial selection and geometric progression (mod N) for number field sieve
• Better polynomials for GNFS
• The Multiple Polynomial Quadratic Sieve
• Non-linear polynomial selection for the number field sieve
• scientific article; zbMATH DE number 1222138 (Why is no real title available?)
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• A Polynomial Sieve and Sums of Deligne Type

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375601)