Paper 2005/116

On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems

Nigel Smart and Frederik Vercauteren

Abstract

In this paper we examine the hard problems underlying asymmetric pairings, their precise relationships and how they affect a number of existing protocols. Furthermore, we present a new model for the elliptic curve groups used in asymmetric pairings, which allows both an efficient pairing and an efficiently computable isomorphism.

Note: Minor corrections only...

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. To appear in Discrete Applied Mathematics
Keywords
Pairing-based cryptographyTate pairingelliptic curve
Contact author(s)
frederik vercauteren @ esat kuleuven be
History
2006-07-03: revised
2005-04-21: received
See all versions
Short URL
https://ia.cr/2005/116
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/116,
      author = {Nigel Smart and Frederik Vercauteren},
      title = {On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems},
      howpublished = {Cryptology ePrint Archive, Paper 2005/116},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/116}},
      url = {https://eprint.iacr.org/2005/116}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.