Generalizations of verheul's theorem to asymmetric pairings
Date
2013
Authors
Karabina, K.
Knapp, E.
Menezes, A.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
2
views
views
13
downloads
downloads
Citation Stats
Series
Abstract
For symmetric pairings e: G × G → GT, Verheul proved that the existence of an efficiently-computable isomorphism Φ: GT → G implies that the Diffie-Hellman problems in G and GT can be efficiently solved. In this paper, we explore the implications of the existence of efficiently-computable isomorphisms Φ1: GT →G1 and Φ2: GT →G2 for asymmetric pairings e: G1 × G2 → GT. We also give a simplified proof of Verheul's theorem. © 2013 AIMS.
Source Title
Advances in Mathematics of Communications
Publisher
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Collections
Language
English