On Computable Isomorphisms in Efficient Pairing Based Systems ⋆
Discrete Applied Mathematics(2005)
摘要
In this paper we examine the underlying hard problems in 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 efficient computable isomorphism.
更多查看译文
关键词
pairing-based cryptography,elliptic curve,tate pairing,pairing based cryptography
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络