ECDLP

(redirected from Elliptic Curve Discrete Logarithm Problem)
AcronymDefinition
ECDLPElliptic Curve Discrete Logarithm Problem
References in periodicals archive ?
2x] is protected under elliptic curve discrete logarithm problem (DLP), and only can be obtained by the one who has the server private key [k.
The problem that finding k according to P, Q and the elliptic curve E is called the Elliptic Curve Discrete Logarithm Problem (ECDLP) over the finite field GF(p).
Since P = dG, it is equivalent to solving the Elliptic Curve Discrete Logarithm Problem (ECDLP) that the attacker tends to solve d using P, which is difficult on computation.
According to the proof process of Theorem 1, the attacker can compute kG = sG + (r + s)P, but it is equivalent to solving the Elliptic Curve Discrete Logarithm Problem (ECDLP) that solving the random number k on this basis, which is difficult on computation.
Hwang, "Two-party authenticated multiple-key agreement based on elliptic curve discrete logarithm problem," International Journal of Smart Home, vol.
As for unforgeability, we prove that A should solve Elliptic Curve Discrete Logarithm Problem (ECDLP) [17] to forge a message.
Definition 1: Elliptic curve discrete logarithm problem (ECDLP) states that if the elliptic curve E is defined over the field [F.
Full browser ?