This is really good for encrypted content such as a hard drive, password vault or gpg key

  • catalog3115@lemmy.world
    link
    fedilink
    arrow-up
    3
    arrow-down
    4
    ·
    5 months ago

    Doesn’t using a particular wordlist limits choice, gives attackers a wordlist to generate the password from

    • laughterlaughter@lemmy.world
      link
      fedilink
      arrow-up
      6
      ·
      5 months ago

      Technically, yes. But the article already mentioned the amount of effort for the brute force to succeed (that is, practically never, if the phrase is truly random.)

      But anyway. With regular passwords, the attackers already have a list: the alphabet plus numbers and symbols. Not really that different.

    • MajorSauce
      link
      fedilink
      arrow-up
      5
      ·
      5 months ago

      Even a “traditional” password would have a “list” that attackers could know (all the possible characters that can be used in a password), now compare this set of ±150 characters with the set of possible words that can be used (probably close to 250k per language if you take out some similarities).

      Even with only 4 words, the number of possibilities is astounding.

    • kevincox@lemmy.ml
      link
      fedilink
      arrow-up
      3
      ·
      5 months ago

      Technically yes. But the method is by far strong enough that this isn’t an issue. This is sort of always the issue with calculating entropy. We say that password has less entropy than 8(A>Ni'[. But that is baking in assumptions about the search space. If password is a randomly generated string of lower, upper, numbers and symbols it is just as secure as the latter. (808 ≈ 1015 candidates) but if password was generated as just lowercase characters it is far less secure (268 ≈ 1011 candidates) but if it was a random dictionary word it is not very secure at all (≈ 105 candidates) and if it was chosen as one of the most popular passwords it is even less secure. How can one password have different entropy?

      The answer is basically it matters how the attacker searches. But in practice the attacker will search the more likely smaller sets first, then expand to the larger. So the added time to search the smaller sets is effectively negligible.

      What may be more useful is the “worst case” entropy. Basically the attacker knows exactly what set you picked. For the password case that is 1 because I just picked the most common password. For the rolling method described above it is 65^6 ≈ 1023 because even if they know the word list they don’t know the rolls. You may be able to go slightly higher by building your own word list, but the gains will probably be fairly small and you would likely get far more value just by rolling one more word on the existing list than spending the time to generate your own.

    • AHemlocksLie@lemmy.zip
      link
      fedilink
      arrow-up
      2
      ·
      5 months ago

      It does limit choice, but so long as you aren’t retaining the generation list somewhere an attacker can find it, how are they to know your list? As long as your list is incorporating less common words, your attacker can’t even simplify the problem by focusing on the most common words. Just one rare word can expand the list they need to use by tens of thousands of words.

    • ShortN0te@lemmy.ml
      link
      fedilink
      arrow-up
      2
      ·
      5 months ago

      Yes, but when the list is long enough and you have enough words, it is to difficult to guess.

      Think about it. The list of all possible characters is also known, still with enough length and randomness it becomes too difficult to guess too.