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 4:51 am, Matt Whitlock wrote:
> 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.
Actually, secrets with value greater than secp256k1_N cannot be supported because the modular arithmetic would destroy them. But any secret smaller than 256 bits would be fine.
Published at
2023-06-07 15:16:39Event JSON
{
"id": "b54232aa4f10ec184bf1a434b472ef9c22caf887a4966a18f5fe9ece81130160",
"pubkey": "f00d0858b09287e941ccbc491567cc70bdbc62d714628b167c1b76e7fef04d91",
"created_at": 1686150999,
"kind": 1,
"tags": [
[
"e",
"cd470d06d90a3107c21da4b48b344ebdd3b4ab813362bb85b0e7a02311012700",
"",
"root"
],
[
"e",
"0b2f65cca802cf4e12ff5a22816f6717c916c5b334e7a3b1767802238cccd86c",
"",
"reply"
],
[
"p",
"67d068d66210043001fce4b17d5084112d3e379c073f25548dfcfa3bb9b770bf"
]
],
"content": "📅 Original date posted:2014-03-29\n📝 Original message:On Saturday, 29 March 2014, at 4:51 am, Matt Whitlock wrote:\n\u003e On Saturday, 29 March 2014, at 9:44 am, Tamas Blummer wrote:\n\u003e \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 \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\u003e \n\u003e 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.\n\nActually, secrets with value greater than secp256k1_N cannot be supported because the modular arithmetic would destroy them. But any secret smaller than 256 bits would be fine.",
"sig": "0f73e675d4cf291e08eda41f02fa66f82e4b42e8c1a31d88bd6a48870724647c4ea495569d4307ebaace361271aea381cafcdffa7d79e930d6099de31412e884"
}