Word separator entropy in passphrases calculation

250 Views Asked by At

I'm trying to find out how much entropy word separators add to a passphrase. Let's say the word list from which we generate our passphrase is 1000 words. If we add space as word separator, how much does the entropy change? what if we add 2@f as separators?

Let's say the character set of any separator is all ASCI characters, so $95$.

A 4 word passphrase taken from a list of 1000 words would have $1000^4$ possible permutations. (example: thatrebornmargaritasloping)

Would 4 word passphrase with a space (' ') as word separator then have $(1000 + 95)^4$ permutations? (For example: that reborn margarita sloping)

Alternatively, what about with 2@f (example: that 2@f reborn 2@f margarita 2@f sloping)

Intuitively, when I change from just word to words + space, the number of permutations doubles. But when I try this out, the word only entropy $85$ bits and with space it goes up to $102$ bits. I assume this entropy calculator is wrong because $\log_2(1000) = 9.965$ bit, so 4 word entropy is about $40$ not $85$. But regardless of this, how much is the separator changing the number of combinations?

1

There are 1 best solutions below

1
On

Strictly speaking about the number of permutations (not combinations ), you would have $95\cdot 1000^4$ possible passwords using your example scheme.

It doesn't matter where you put the "separator" character in your passwords; all you're doing is picking one more symbol out of a pool of $95$. Repeating this character multiple times as "spaces" in the password is essentially pointless. The only effect it has is reducing the "density of entropy" in the password and making harder to type. You would do far better by, for example, just adding one more word. You may wish consult Information Security Stack Exhange for more information about password security (such as this question on password creation strategies).