Timeline for Why is the strength of an Elliptic Curve Cryptography (ECC) half the size of the prime field size?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 3, 2019 at 9:00 | history | tweeted | twitter.com/StackCrypto/status/1124237363373334528 | ||
| May 3, 2019 at 1:41 | comment | added | dave_thompson_085 | There is no '(mod p)' in the ECC computation; the scalar multiplication operation $k \cdot G$ already takes both x and y coordinates of the point(s) separately mod p. Note in general ECC strength is half the size of the order of the curve subgroup not the underlying field, but the X9/NIST prime curves in particular are chosen so the subgroup order equals the curve order, and by Hasse's theorem the curve order, although not equal to p, is the same size as p. The former is not true for some other curves, notably Curve25519 and Curve448. | |
| May 2, 2019 at 23:48 | vote | accept | THG | ||
| May 2, 2019 at 23:40 | answer | added | kodlu | timeline score: 5 | |
| May 2, 2019 at 22:30 | review | First posts | |||
| May 3, 2019 at 6:17 | |||||
| May 2, 2019 at 22:28 | history | asked | THG | CC BY-SA 4.0 |