Cryptology ePrint Archive: Report 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.

Category / Keywords: Pairing-based cryptography, Tate pairing, elliptic curve

Publication Info: To appear in Discrete Applied Mathematics

Date: received 20 Apr 2005, last revised 3 Jul 2006

Contact author: frederik vercauteren at esat kuleuven be

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: Minor corrections only...

Version: 20060703:125618 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]