## CryptoDB

### Paper: On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems

Authors: Nigel P. Smart Frederik Vercauteren URL: http://eprint.iacr.org/2005/116 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2005-12452,
title={On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems},
booktitle={IACR Eprint archive},
keywords={Pairing-based cryptography, Tate pairing, elliptic curve},
url={http://eprint.iacr.org/2005/116},
note={To appear in Discrete Applied Mathematics frederik.vercauteren@esat.kuleuven.be 13332 received 20 Apr 2005, last revised 3 Jul 2006},
author={Nigel P. Smart and Frederik Vercauteren},
year=2005
}