Knowledge check

Elliptic Curve Cryptography (ECC / ECDSA)

10 questions testing what you just read — no login, no tracking, just immediate feedback.

Question 1 of 10

What is the elliptic curve discrete logarithm problem (ECDLP)?

Question 2 of 10

What causes ECDSA to catastrophically leak the private key?

Question 3 of 10

Roughly what RSA key size gives equivalent classical security to a 256-bit ECC key?

Question 4 of 10

What is the general equation of an elliptic curve used in ECC?

Question 5 of 10

Geometrically, how is "adding" two distinct points P and Q on an elliptic curve defined?

Question 6 of 10

How is point doubling (adding P to itself) computed?

Question 7 of 10

How is scalar multiplication (computing kG for a 256-bit private key k) actually performed?

Question 8 of 10

In the module's worked example over y²=x³+2x+2 (mod 17) with G=(5,1), what is 2G?

Question 9 of 10

What distinguishes Curve25519 from NIST P-256, according to the module?

Question 10 of 10

Why might ECC be, if anything, a more urgent PQC migration target than RSA in some contexts?

0 / 10 answered