Skip to main content
SpringerLink
Log in

A Polynomial Representation of the Diffie-Hellman Mapping

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

 Let F q be the finite field of order q and γ be an element of F q of order d. The construction of an explicit polynomial of degree with the property for is described. In particular the exact degree and sparsity of f are determined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19/2, 1010 Vienna, Austria (email: {wilfried.meidl, arne.winterhof}@oeaw.ac.at), , , , , , AT

    Wilfried Meidl & Arne Winterhof

Authors
  1. Wilfried Meidl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arne Winterhof
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: February 8, 2001; revised version: August 8, 2002

Keywords: Diffie-Hellman cryptosystem, Polynomial interpolation, Degree, Sparsity.

The work was partially supported by the Austrian Science Fund (FWF) under the project S8306-MAT

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meidl, W., Winterhof, A. A Polynomial Representation of the Diffie-Hellman Mapping. AAECC 13, 313–318 (2002). https://doi.org/10.1007/s00200-002-0104-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-002-0104-2

Keywords

Search

Navigation