My understanding is that k . G = (x,y) And under the hood, 0 <= x <= p and 0 <= y <= p.
Then the next step I believe is r = x mod n and NOT r = x mod p So in this case, because p > n - then x will wrap around the modulus from time to time? Otherwise, if it is r = x mod p, then x will never actually wrap around p? such that r = x always. -- View this message in context: http://openssl.6102.n7.nabble.com/ECDSA-OpenSSL-Implementation-using-the-modulus-N-instead-of-field-size-q-tp47743p48647.html Sent from the OpenSSL - User mailing list archive at Nabble.com. ______________________________________________________________________ OpenSSL Project http://www.openssl.org User Support Mailing List openssl-users@openssl.org Automated List Manager majord...@openssl.org
