Concept椭圆曲线离散对数问题 / Elliptic Curve Discrete Logarithm Problem
ECDLP
A mathematical problem in elliptic curve cryptography that refers to the difficulty of finding the integer k given points P and Q = kP on an elliptic curve, and which forms the basis of the security of ECC.
Timeline (last 90 days)
Oct 30
In elliptic curve cryptography, the private key is a random integer, and the public key is the result of multiplying the private key by a fixed base point on the elliptic curve; deriving the private key from the public key requires solving the elliptic curve discrete logarithm problem (ECDLP), for which there is currently no feasible algorithm on classical computers.
Unverified50%