Matt Whitlock [ARCHIVE] on Nostr: 📅 Original date posted:2014-03-29 📝 Original message:On Saturday, 29 March ...
📅 Original date posted:2014-03-29
📝 Original message:On Saturday, 29 March 2014, at 9:44 am, Tamas Blummer wrote:
> I used Shamir's Secret Sharing to decompose a seed for a BIP32 master key, that is I think more future relevant than a single key.
> Therefore suggest to adapt the BIP for a length used there typically 16 or 32 bytes and have a magic code to indicate its use as key vs. seed.
Master keys of 32 bytes would work as-is, as ordinary private keys are also 32 bytes. Secrets of other lengths could be supported if the function that generates a[i] from a[i-1] (which is presently SHA-256) were replaced with a function having parameterized output length, such as scrypt.
Base58Check encodings of shares for secrets of lengths other than 32 bytes would have prefixes other than "SS", but that's not a huge concern. I suspect 32 bytes would be the most common secret length anyway, wouldn't you?
Published at
2023-06-07 15:16:35Event JSON
{
"id": "d98e863584c260f1d6df887c886bd2542112757f8a536fb9b95356883a08eb57",
"pubkey": "f00d0858b09287e941ccbc491567cc70bdbc62d714628b167c1b76e7fef04d91",
"created_at": 1686150995,
"kind": 1,
"tags": [
[
"e",
"cd470d06d90a3107c21da4b48b344ebdd3b4ab813362bb85b0e7a02311012700",
"",
"root"
],
[
"e",
"9e8450edc1fa503143dbc2b8e60b334b7c516009f63543280ba0e6e494d80715",
"",
"reply"
],
[
"p",
"c632841665fccdabf021322b1d969539c9c1f829ceed38844fea24e8512962d7"
]
],
"content": "📅 Original date posted:2014-03-29\n📝 Original message:On Saturday, 29 March 2014, at 9:44 am, Tamas Blummer wrote:\n\u003e I used Shamir's Secret Sharing to decompose a seed for a BIP32 master key, that is I think more future relevant than a single key.\n\u003e Therefore suggest to adapt the BIP for a length used there typically 16 or 32 bytes and have a magic code to indicate its use as key vs. seed.\n\nMaster keys of 32 bytes would work as-is, as ordinary private keys are also 32 bytes. Secrets of other lengths could be supported if the function that generates a[i] from a[i-1] (which is presently SHA-256) were replaced with a function having parameterized output length, such as scrypt.\n\nBase58Check encodings of shares for secrets of lengths other than 32 bytes would have prefixes other than \"SS\", but that's not a huge concern. I suspect 32 bytes would be the most common secret length anyway, wouldn't you?",
"sig": "fe575790f816abd7854728971aeb23831e43cc33b448a3baec47a80c8a8bb98b542783f309d3b3dcefede78db96b99fd4903aed72936d791410a9fd3ff8eb33c"
}