Currently, public-key compression of supersingular isogeny Diffie-Hellman (SIDH) and its variant, supersingular isogeny key encapsulation (SIKE) involve pairing computation and discrete logarithm computation. In this paper, we propose novel methods to compute only 3 discrete logarithms instead of 4, in exchange for computing a lookup table efficiently. The algorithms also allow us to make a trade-off between memory and efficiency. Our implementation shows that the efficiency of our algorithms is close to that of the previous work, and our algorithms perform better in some special cases.
翻译:目前,超级单向异源同位素Diffie-Hellman(SIDH)及其变体、超级单向关键封装(SIKE)的公用钥匙压缩涉及配对计算和离散对数计算。在本文中,我们提出了新颖的方法,只计算3个离散对数而不是4个,以有效计算一个查看表。算法还使我们能够在记忆与效率之间作出权衡。我们的实施表明,我们的算法效率接近于以往的工作,我们算法在某些特殊情况下效果更好。