On computable isomorphisms in efficient asymmetric pairing-based systems

Nigel Smart, Fre Vercauteren

Research output: Contribution to journalArticle (Academic Journal)peer-review

27 Citations (Scopus)

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.
Translated title of the contributionOn computable isomorphisms in efficient asymmetric pairing-based systems
Original languageEnglish
Pages (from-to)538-547
JournalDiscrete Applied Mathematics
Volume155(4)
Publication statusPublished - 2007

Bibliographical note

Other identifier: 2000622

Fingerprint Dive into the research topics of 'On computable isomorphisms in efficient asymmetric pairing-based systems'. Together they form a unique fingerprint.

Cite this