It is not the case that r = f(s) for the signature. 'r' and 's' are
two calculated integers (not a point), and computed at
<
https://github.com/weidai11/cryptopp/blob/master/gfpcrypt.h#L315>.
Typically when working with elliptic curves, the private key is an
exponent, and it is an Integer. The public key is a point, and the
point is a pair of integers with x and y components. For public and
private keys, you can solve the y coordinate given the x coordinate.
In fact, compressed points use this trick to save space. A compressed
point only provides the x coordinate, if I recall correctly.
Also take a look at
<
https://www.cryptopp.com/wiki/Elliptic_Curve_Digital_Signature_Algorithm>.
In particular, see the example OpenSSL and Java. It converts between
ASN.1 format and IEEE P1363 formats. OpenSSL and Java use an ASN.1/DER
signature format, and Crypto++ uses IEEE P1363 format.
Jeff