Timeline for Why did monero-wallet-cli restore the same wallet with different mnemonic seeds?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:53 | history | edited | CommunityBot |
replaced http://monero.stackexchange.com/ with https://monero.stackexchange.com/
|
|
| Oct 3, 2016 at 17:06 | comment | added | Luigi |
Yes that's all sc_reduce32 does. Private keys are indeed little endian.
|
|
| Oct 3, 2016 at 7:56 | history | edited | JollyMort | CC BY-SA 3.0 |
added 37 characters in body
|
| Oct 3, 2016 at 7:49 | comment | added | JollyMort |
I've been looking at it wrong. The keys seem to be little-endian, and then n_red < l < n holds true for the below example. Looking at the code of sc_reduce32 I couldn't understand because it seems to be a optimized C function which I believe performs a n mod l operation, resulting in our n_red < l, as implemented here.
|
|
| Oct 3, 2016 at 0:23 | comment | added | user141 |
@JollyMort: I don't understand sc_reduce32 well, so right now I can't help understanding whether n_red > n is a problem or not, sorry. Note however that n < l and n_red > n does not imply n_red > l; it could be that n < n_red < l. // On the other hand, looking at Luigi's comment and your reply to it, I think his point was just that in EC cryptography the private key is simply a random secret number r, unlike the public key P which is actually a point on the curve (such that P = r*G, for a fixed base point G in the curve).
|
|
| Oct 2, 2016 at 5:12 | comment | added | JollyMort | I understood that, thanx. So why, in the below example, is the reduced integer "larger" than the original (n=6d32... n_red=938a...) if the requirement is n < l and our n_red > n which implies n_red > l if we started with n > l. | |
| Oct 1, 2016 at 16:02 | comment | added | user141 | @JollyMort: Let P be a point on the EC, which is closed under addition. Then if denote 2*P := P+P, that will still be a point on the curve. Similarly, so will 3*P := P+P+P, 4*P := P+P+P+P etc. So that nP just means "add P to itself n times". We call that integer n a scalar. // The point about the order l of the base point G is that lG will be the identity, in other words: nG will be all different points on the curve for n in {1,2,...,l} but beyond that you will just repeat the list of points. | |
| Oct 1, 2016 at 2:49 | comment | added | JollyMort | care to elaborate what a "scalar" means in EC context? I'd like to expand it a bit, would also like to understand what sc_reduce32 actually does | |
| Sep 30, 2016 at 22:16 | comment | added | Luigi |
it's a point on the elliptic curve It's really a scalar < l; public keys are curve points.
|
|
| Sep 30, 2016 at 16:56 | history | edited | JollyMort | CC BY-SA 3.0 |
deleted 1 character in body; added 7 characters in body
|
| Sep 30, 2016 at 16:51 | history | answered | JollyMort | CC BY-SA 3.0 |