I have a cryptological question. I know it doesn’t fit well here, but I know here are smart people around and I don’t have many social media accounts.
I saw a cool BIP39 tool by Ian Coleman: https://iancoleman.io/bip39/ but in one place it’s sugested to split a BIP39 mnemonic into 3 parts like this:
BIP39 Mnemonic perfect unlock twenty worth govern rice flat congress office range zoo rescue maximum west audit never beauty motor club proud myself certain horn pepper BIP39 Split Mnemonic (Seed Recovery Requires 2 Of 3 Cards) Card 1: perfect XXXX XXXX worth govern rice flat congress XXXX range XXXX XXXX maximum XXXX XXXX never beauty motor club proud XXXX certain horn pepper Card 2: perfect unlock twenty XXXX govern XXXX XXXX XXXX office range zoo rescue maximum west audit XXXX beauty XXXX XXXX proud myself certain horn XXXX Card 3: XXXX unlock twenty worth XXXX rice flat congress office XXXX zoo rescue XXXX west audit never XXXX motor club XXXX myself XXXX XXXX pepper Time to hack with only one card: 3830854 years
Now this seems dangerous to me. To me it looks like a single card has only very weak entropy - I think one BIP39 word is worth 11 bits of entropy and the last word is a checksum.
So card 1 + 3 have 88 bits of entropy minus what the checksum word gives you. I’m not sure, but it definitely lowers the entropy a great deal. Card 2 has only about 77 bits of entropy.
Why the heck does the program tell the “time to hack” so ridicously high? It seems to me like a big mistake.
I’m not sure but it seems to me that the checksum word could even lower the entropy of card 1 + 3 well below 80 bits, maybe even below 77 bits. So all in all I’d say it’s really not the optimal solution what this program suggests here.