Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421438 | Discrete Applied Mathematics | 2007 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
N.P. Smart, F. Vercauteren,