Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2014-02-28 Thread Paddy
On 20 December 2013 09:09, Patrick McCorry [hidden email] wrote: Thanks Guys, At the moment I'm trying to distinguish if n p, as the x co-ordinate does not wrap around n (so x = r in all cases) - to verify if this is always the case n can be greater than p, e.g. see the definition of

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2014-02-28 Thread Matt Caswell
On 28 February 2014 17:07, Paddy stonecold...@gmail.com wrote: On 20 December 2013 09:09, Patrick McCorry [hidden email] wrote: Thanks Guys, At the moment I'm trying to distinguish if n p, as the x co-ordinate does not wrap around n (so x = r in all cases) - to verify if this is always the

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2014-02-28 Thread Paddy
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

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2013-12-20 Thread Patrick McCorry
Thanks Guys, At the moment I'm trying to distinguish if n p, as the x co-ordinate does not wrap around n (so x = r in all cases) - to verify if this is always the case Sent from my iPad On 20 Dec 2013, at 04:16, Billy Brumley bbrum...@gmail.com wrote: ... yet it seems you are free to use

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2013-12-20 Thread Matt Caswell
On 20 December 2013 09:09, Patrick McCorry stonecold...@gmail.com wrote: Thanks Guys, At the moment I'm trying to distinguish if n p, as the x co-ordinate does not wrap around n (so x = r in all cases) - to verify if this is always the case n can be greater than p, e.g. see the

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2013-12-19 Thread Billy Brumley
http://en.wikipedia.org/wiki/Elliptic_Curve_DSA order in the code you pasted = n in the wiki = N in your mail. The code you pasted refers to GFp so the points (x,y) satisfy 0 = x p and 0 = y p. That's probably what you mean by q. Anyway, it's used in the underlying elliptic curve operations

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2013-12-19 Thread Patrick McCorry
Thank you Billy for the clarification - is there a way to retrieve the value for p that is used under the hood? I assume the p value does not change (unless the curve is changed). Sent from my iPhone On 19 Dec 2013, at 17:35, Billy Brumley bbrum...@gmail.com wrote:

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2013-12-19 Thread Billy Brumley
It's in the EC_GROUP structure: group-field. Check crypto/ec/ec_lcl.h. BBB On Thu, Dec 19, 2013 at 9:54 AM, Patrick McCorry stonecold...@gmail.com wrote: Thank you Billy for the clarification - is there a way to retrieve the value for p that is used under the hood? I assume the p value does

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2013-12-19 Thread Matt Caswell
On 19 December 2013 18:52, Billy Brumley bbrum...@gmail.com wrote: It's in the EC_GROUP structure: group-field. Check crypto/ec/ec_lcl.h. BBB Anything in the *lcl.h header files does not form part of the public API and you shouldn't really rely on it as it may change. Better is to use: int

Re: ECDSA - OpenSSL Implementation using the modulus (N) instead of field size (q)?

2013-12-19 Thread Billy Brumley
... yet it seems you are free to use it as you please (like the rest of the library does) internally, so it depends on what you are doing. (Modifying the library or creating an application -- since you posted code snippets I assumed the former, Matt points out the proper way externally.) BBB On