Sciweavers

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

11

AAECC
2002
Springer

favoriteEmaildiscussreport

98views Algorithms» more AAECC 2002»

A Polynomial Representation of the Diffie-Hellman Mapping

13 years 4 months ago

A Polynomial Representation of the Diffie-Hellman Mapping

Download www.ricam.oeaw.ac.at

Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for 0 i d - 1 is described. In particular the exact degree and sparsity of f are determined.

Wilfried Meidl, Arne Winterhof

Real-time Traffic

AAECC 2002 | Algorithms | Exact Degree | Explicit Polynomial | Finite Field |

claim paper

Related Content

» Interpolation of the Elliptic Curve DiffieHellman Mapping

» Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem

» Balanced statespace representations a polynomial algebraic approach

» Path Planning for PermutationInvariant MultiRobot Formations

» ItohTsujii Inversion in Standard Basis and Its Application in Cryptography and Codes

» Meshfree Representation and Computation Applications to Cardiac Motion Analysis

» Capitalize on Dimensionality Increasing Techniques for Improving Face Recognition Grand Ch...

» Efficient irradiance normal mapping

» Reduction of Distortions in MRSI Using a New Signal Model

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2002
Where	AAECC
Authors	Wilfried Meidl, Arne Winterhof

Comments (0)