Given a 12 or 24 word seed with one one or more missing words what would be the difficulty of brute-forcing the missing words? E.g. for:
- one missing word
- two missing words
- three missing words
By difficulty I mean the number of permutations against a dictionary wordlist.
And the related question: how many words would have to be missing in order to make the attack reliably unfeasible?