A general polynomial sieve.

DOI10.1023/A:1008393304548MaRDI QIDQ1591638zbMATH OpenOpenAlexFDO

Authors Shuhong Gao, Jason Howell

Publication date 1 January 2001

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008393304548

zbMATH Keywords

discrete logarithmsfinite fieldspolynomial sievesmooth polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 691483
• scientific article; zbMATH DE number 799769
• The index calculus method using non-smooth polynomials
• Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
• Selecting polynomials for the function field sieve

Cited in

(4)

• The index calculus method using non-smooth polynomials
• scientific article; zbMATH DE number 691483 (Why is no real title available?)
• Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
• The affine sieve

This page was built for publication: A general polynomial sieve.

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