Timeline for 12 or 24 words for mnemonic?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 10, 2023 at 22:27 | history | edited | V2Blast | CC BY-SA 4.0 |
removed unnecessary edit note
|
| Apr 28, 2023 at 1:34 | comment | added | Poseidon | I think that the password would not add extra entropy in the case of Pollard's rho algorithm, HD wallets prevent a trivial attack that can reveal a parent private key given one of its child public private key pairs. So if an attacker theoretically attacked one HD key it would not allow them to reveal its parent which would mean probably revealing all child keys as well. But in general I don't think its feasible to attack 128 bit keys with pollard's rho in the current state of computing limitations. I believe there is some people attempting to do this at large power costs on btc talk forum. | |
| Feb 26, 2023 at 9:45 | comment | added | WebOrCode | @PieterWuille So if I understand it correctly, everything above 128 bit is useless ?Does this include also additional passphrase ? My understand is that it does ? Let say that it is possible to finding a private key given the public key (Pollard's rho algorithm) how is this related to HD wallets ? My understanding is that still you would not get master seed but just for this address. Is it correct ? I am using terminology from github.com/bitcoin/bips/blob/master/bip-0032/derivation.png Just trying to wrap my head around it. | |
| Feb 25, 2023 at 20:09 | history | edited | Poseidon | CC BY-SA 4.0 |
deleted 358 characters in body
|
| Feb 25, 2023 at 19:30 | comment | added | Poseidon | Very interesting, so theoretically the only way to make it tougher to crack would be to increase the private-key size which ends up increasing the size of the overall elliptic curve scheme? | |
| Feb 25, 2023 at 19:28 | comment | added | Pieter Wuille | 24 words = 256 bits, 12 words = 128 bits. But finding a private key given the public key already costs only 2^128 operations (using e.g. Pollard's rho algorithm, not using brute force of course). So if an attacker can just attack the private key keys that come out directly, there is no reason to try to find the seed. | |
| Feb 25, 2023 at 18:25 | comment | added | Poseidon | This makes sense, my main point was that guessing 24 permutations of words should be more difficult than 12 but I guess it is not an effective increase in difficulty? How many more bits do 24 word phrases have compared to 12 word? | |
| Feb 25, 2023 at 6:00 | comment | added | Pieter Wuille | In fact, cryptographically speaking, there is no benefit to private keys having more than 128 bits of entropy, as long as there is no pattern in them (e.g. don't use just 128 bit numbers as private keys, that's broken, but using the hash of 128 bit numbers appears to be just fine). The reason for suggesting more is just defense in depth. | |
| Feb 25, 2023 at 3:58 | history | answered | Poseidon | CC BY-SA 4.0 |
