A General Polynomial Sieve

Authors:
Shuhong Gao;Jason Howell
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC 29634 USA;Department of Mathematical Sciences, Clemson University, Clemson, SC 29634 USA
Venue:
Designs, Codes and Cryptography
Year:
1999

Citing 7
Cited 1

The quadratic sieve factoring algorithm

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Discrete logarithms in finite fields and their cryptographic significance

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Discrete logarithms in GF(P) using the number field sieve

SIAM Journal on Discrete Mathematics
An algorithm for evaluation of discrete logarithms in some nonprime finite fields

Mathematics of Computation
Massively Parallel Computation of Discrete Logarithms

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
The function field sieve

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Discrete Logarithms: The Effectiveness of the Index Calculus Method

ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory

The Function Field Sieve Is Quite Special

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

An important component ofthe index calculus methods for finding discrete logarithms isthe acquisition of smooth polynomial relations. Gordon and McCurley(1992) developed a sieve to aid in finding smooth Coppersmithpolynomials for use in the index calculus method. We discusstheir approach and some of the difficulties they found with theirsieve. We present a new sieving method that can be applied toany affine subspace of polynomials over a finite field.