A General Polynomial Sieve

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

• Type: Journal
• Year: 1999
• Where: DCC
• Authors: Shuhong Gao, Jason Howell
• Keywords: Computer Graphics, DCC 1999, Polynomials, Smooth Coppersmith Polynomials, Smooth Polynomial Relations