Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

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

Antoine JouxContact Information

(5)  DCSSI Crypto Lab, 51, Bd de Latour Maubourg, F-75700 Paris 07 SP, France
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.

Contact Information Antoine Joux
Email: Antoine.Joux@m4x.org
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Referenced by
3 newer articles

  1. Galbraith, Steven D. (2007) Simplified pairing computation and security implications. Journal of Mathematical Cryptology 1(3)
    [CrossRef]
  2. Dehkordi, Massoud Hadian (2009) Zero-knowledge identification scheme based on Weil pairing. Lobachevskii Journal of Mathematics 30(3)
    [CrossRef]
  3. Cheon, Jung-Hee (2009) A NOTE ON SELF-BILINEAR MAPS. Bulletin of the Korean Mathematical Society 46(2)
    [CrossRef]
Remote Address: 38.107.191.105 • Server: mpweb01
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)