The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems

Survey
  • Antoine Joux
Conference paper

DOI: 10.1007/3-540-45455-1_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2369)
Cite this paper as:
Joux A. (2002) The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems. In: Fieker C., Kohel D.R. (eds) Algorithmic Number Theory. ANTS 2002. Lecture Notes in Computer Science, vol 2369. Springer, Berlin, Heidelberg

Abstract

Elliptic curves were first proposed as a tool for cryptography by V. Miller in 1985 [29]. Indeed, since elliptic curves have a group structure, they nicely fit as a replacement for more traditional groups in discrete logarithm based systems such as Diffie-Hellman or ElGamal. Moreover, since there is no non-generic algorithm for computing discrete logarithms on elliptic curves, it is possible to reach a high security level while using relatively short keys.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Antoine Joux
    • 1
  1. 1.DCSSI Crypto LabParis 07 SPFrance

Personalised recommendations