Welcome to the resource topic for 2005/116
Title:
On Computable Isomorphisms in Efficient Asymmetric Pairing Based Systems
Authors: 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.
ePrint: https://eprint.iacr.org/2005/116
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .