Timeline for Using a public key's points (other than the generator point) to calculate the order of the group (SECP256k1)?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 5 at 14:22 | vote | accept | Maltoon Yezi | ||
| Aug 4 at 10:40 | comment | added | Maltoon Yezi | Ok, I understand. Thank you! | |
| Aug 4 at 9:21 | comment | added | kelalaka | In short, yes, however, they use Hasse's theorem on elliptic curves, the Chinese remainder theorem, division polynomials, and modular polynomials. Division polynomials is a way to to calculate multiples of points on elliptic curves and to study the fields generated by torsion points. You don't enter a point to Schoof-Elkies-Atkin or Schoof's aclgorithm | |
| Aug 4 at 8:33 | comment | added | Maltoon Yezi |
So the Schoof-Elkies-Atkin just uses the order of the finite field p and the equation $y^2 = x^3 + ax + b$ and nothing else?
|
|
| Aug 3 at 18:38 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Aug 3 at 18:24 | history | answered | kelalaka | CC BY-SA 4.0 |