-
If an attacker gets one share, they then have 16/24 words. I believe the overall entropy is 128 bits, if so, that leaves only 42 bits left to be brute forced. That's 4.3e12 combinations, which is defi…
-
## Abstract
One reason for a slow crypto adoption are insecure and user-unfriendly wallet solutions. If a user wants to be his own bank and take over the responsibility to securely manage funds, an…
-
Currently SecretSharing#reconstruct accepts a collection of shares and tries to reconstruct it.
For usage in the archistar-core prototype a new function "checkValidShareCount(Share[] shares)" would b…
-
Hi,
I have noticed that when splitting a 64-byte (512 bit) key, the result is 113 bytes long.
That seems wrong. Please see the 'minimal' property of sss on Wikipedia: https://en.wikipedia.org/wiki…
-
len(seed) is bigger than primes.keys() in shamir.py so you get an "Unknown data length" exception. Works fine with the example sentence "Shamir's Secret Sharing Scheme!" because it's 31 in length, but…
-
Hello,
What happens if I get run over by the bus? What happens if I die?
I have a bunch of Masternodes that are worth a fortune. I don't want to give private keys to anyone, not even my family. Bu…
-
This could be an enhancement.
As far as I can tell the full ciphertext is simply appended to the key share, i.e. everything from byte 34 onward is identical in every 'shard'.
For testing purpose…
-
It would be useful to have list of requirements for a future replacement of the standards around hierarchical deterministic wallets and other uses of deriving keys from a mnemonic. Let me know if this…
Sjors updated
6 years ago
-
Hi,
I have noticed a few issues with the sharded phrases, which might be related and have a common cause, so I don't want to create a separate issue for each unless advised otherwise:
1. The fir…
-
The criteria is:
* Low multiplicative complexity
* Implementable in Solidity / EVM with low gas cost
* Work as a hash function
* Can be used to construct a Merkle tree
Candidates from aut…