On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems

Nigel Smart; Frederik Vercauteren

Paper 2005/116 Original: eprint.iacr.org/2005/116 ↗

On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems

Nigel Smart

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.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2006-07-03: last updated; 2005-04-21: published
Short URL: https://ia.cr/2005/116
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2005/116}
}