Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

DCC
1999
IEEE

favoriteEmaildiscussreport

85views Computer Graphics» more DCC 1999»

A General Polynomial Sieve

13 years 4 months ago

A General Polynomial Sieve

Download www.math.clemson.edu

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.

Shuhong Gao, Jason Howell

Real-time Traffic

Computer Graphics | DCC 1999 | Polynomials | Smooth Coppersmith Polynomials | Smooth Polynomial Relations |

claim paper

Related Content

» Rotations and Translations of Number Field Sieve Polynomials

» HallLittlewood polynomials and fixed point enumeration

» On Quadratic Polynomials for the Number Field Sieve

» Optimization Strategies for HardwareBased Cofactorization

» From a Zoo to a Zoology Towards a General Theory of Graph Polynomials

» A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal

» Sieve A Tool for Automatically Detecting Variations Across Program Versions

» Learning with Queries Corrupted by Classification Noise

» The construction of good extensible Korobov rules

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	DCC
Authors	Shuhong Gao, Jason Howell

Comments (0)