It’s not chosen; it’s computed.
The elliptic curve level multiplication algorithm outputs some extent, which has an X and Y coordinate.
Whereas it’s true that negating the personal key will negate the general public key’s Y coordinate, there isn’t a easy rule for figuring out what the parity of Y will probably be with out really performing the elliptic curve multiplication operation. Actually, there can’t be such a rule; it might represent a break within the discrete logarithm safety of the curve.
It’s not chosen; it’s computed.
The elliptic curve level multiplication algorithm outputs some extent, which has an X and Y coordinate.
Whereas it’s true that negating the personal key will negate the general public key’s Y coordinate, there isn’t a easy rule for figuring out what the parity of Y will probably be with out really performing the elliptic curve multiplication operation. Actually, there can’t be such a rule; it might represent a break within the discrete logarithm safety of the curve.
