🖤

[digaran]

🖤

[Medusah]

If you can solve this, then maybe stay silent or you will be executed in a day as everything in cybersecurity relies on P ≠ NP. 

No amount of money can buy us this answer.  We hopefully do not deserve it.

[tromp]

I know the article is for 2014, but I just found out what NP really means, but have a question:
Is solving DLP considered to be one of the 7 millennium problems in mathematics?

No; the Discrete Logarithm Problem is not one of them.

The closest problem on the list is P vs NP.
P = NP implies that DLP is easy, but the reverse implication need not hold.