Kastalia Knowledge Management System · Glasperlenspiel template · knot 88

Statement 2.1 :: Proof that ECDLP cannot be solved ...

🌐 public · created AE510824 (24.08.2021) · by DDH · open in the standard editor view · 📽 open as presentation

... is equivalent to proving that P != NP.

(E.g. proving that ECDLP cannot be solved would mean that there exist a class of problems which can be quickly verified but cannot be quickly solved.)

Ancestors (1 superordinated path)

2. Hanc marginis exiguitas non caperet/ Statement 2.1 :: Proof that ECDLP cannot be solved ...