Public Key Cryptography - PKC 2008
Public Key Cryptography - PKC 2008
复制标题
公钥密码学 - PKC 2008
DOI：
10.1007/978-3-540-78440-1_18
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Galbraith S
中科院分区：
文献类型：
--
作者：
Galbraith S
矢量分解问题是公钥密码系统安全性的计算基础。我们给出了一个概括和简化的结果Yoshida的VDP。然后，我们表明，超奇异椭圆曲线，可以在实际中使用，VDP是等价的计算Diffie-Hellman问题（CDH）在循环群。对于更广泛的一类配对友好的椭圆曲线，我们涉及VDP的各种合作CDH问题，也是一个广义的离散对数问题2-DL，这反过来又往往是相关的离散对数问题，在循环群。
The vector decomposition problem (VDP) has been proposed as a computational problem on which to base the security of public key cryptosystems. We give a generalisation and simplification of the results of Yoshida on the VDP. We then show that, for the supersingular elliptic curves which can be used in practice, the VDP is equivalent to the computational Diffie-Hellman problem (CDH) in a cyclic group. For the broader class of pairing-friendly elliptic curves we relate VDP to various co-CDH problems and also to a generalised discrete logarithm problem 2-DL which in turn is often related to discrete logarithm problems in cyclic groups.