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. For efficiency, relatively large storage of precomputed values is required for discrete logarithm computation. In this paper, we propose novel algorithms to compute discrete logarithms, allowing 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) 涉及对齐计算和离散对数计算。 为了效率,离散对数计算需要存储相对大的预算值。 在本文中,我们提出了计算离散对数的新算法, 使我们能够在内存与效率之间作出权衡。 我们的实施表明,我们的算法效率接近于先前的工作效率, 在某些特殊情况下, 我们的算法效果更好 。