• Primarily0617
    link
    fedilink
    21 year ago

    It depends on the hash. E.g., OWASP only recommends 2 iterations of Argon2id as a minimum.

    Yes, a hashing function is designed to be resource intensive, since that’s what makes it hard to brute force. No, a hashing function isn’t designed to be infinitely expensive, because that would be insane. Yes, it’s still a bad thing to provide somebody with a force multiplier like that if they want to run a denial-of-service.

    • @[email protected]
      link
      fedilink
      English
      11 year ago

      I’m a bit behind on password specific hashing techniques. Thanks for the education.

      My background more in general purpose one way hashing functions where we want to be able to calculate hashes quickly, without collisions, and using a consistent amount of resources.

      If the goal is to be resource intensive why don’t modern hashing functions designed to use more resources? What’s the technical problem keeping Argon2 from being designed to eat even more cycles?

      • Primarily0617
        link
        fedilink
        1
        edit-2
        1 year ago

        Argon2 has parameters that allow you to specify the execution time, the memory required, and the degree of parallelism.

        But at a certain point you get diminishing returns and you’re just wasting resources. It seems like a similar question to why not just use massive encryption keys.