橢圓曲線密碼系統之曲線安全性研究

Abstract

現今許多密碼系統的安全性, 是以橢圓曲線離散對數問題(ECDLP) 的困難度為基礎。這些密碼系統的安全性, 通常取決於曲線的選擇。在這篇論文中, 我們對現在針對橢圓曲線離散對數問題的攻擊法做一個整理, 找出弱曲線的條件, 也提出一些安全曲線應該有的條件。另外, 我們也會討論一些其他的攻擊法, 這些攻擊法對ECDLP 是失敗的。

The elliptic curve discrete logarithm problem (ECDLP) forms the basis of numerous cryptosystems today. The security of these cryptosystems usually depends on the choice of curves. In this thesis, we give a summary of recent attacks on the ECDLP, find the criteria of weak curves, and suggest the conditions that a secure curve should have. We will also discuss some attacks which works on the DLP but may fail to the ECDLP.