baumhaus.digital/Design & Computation/Perspectives in Engineering/IOPS/Problem & Solution/problem(s)/13 teacher-proposed D&C problems/Elliptic Curve Discrete Logarithm Problem
Unsolvability of ECDLP is the pillar on which modern asymmetric cryptography (e.g. cryptocurrencies, communication with products of military-industrial complex etc.) stands.
Status: uncertain and potentially meta-unsolvable *
Approach: apt install sagemath, pen & paper, hope
* proof of ECDLP unsolvability is equivalent to solving the P = NP Millenium Problem