Sciweavers

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

26

DCC
2002
IEEE

favoriteEmaildiscussreport

99views Computer Graphics» more DCC 2002»

Polynomial Interpolation of the Discrete Logarithm

14 years 10 months ago

Polynomial Interpolation of the Discrete Logarithm

Download www.ricam.oeaw.ac.at

Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field Fp by polynomials modulo p and modulo p -1, respectively. In this paper most of these results are extended to arbitrary Fpr .

Arne Winterhof

Real-time Traffic

Computer Graphics | DCC 2002 | Prime Field Fp |

claim paper

Related Content

» Interpolation of Functions Related to the Integer Factoring Problem

» Finding lowweight polynomial multiples using discrete logarithm

» An algorithm for evaluation of discrete logarithms in some nonprime finite fields

» On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» An accurate LNS arithmetic unit using interleaved memory function interpolator

» A General Polynomial Sieve

» Constructing high order elements through subspace polynomials

» Hermite interpolation of nonsmooth functions preserving boundary conditions

Post Info
More Details (n/a)

Added	25 Dec 2009
Updated	25 Dec 2009
Type	Conference
Year	2002
Where	DCC
Authors	Arne Winterhof

Comments (0)