3 ms·
If you used a per-user list-wide salt, there wouldn't be any scaling issues. And the requirements themselves dictate that there's a small search space.
by anamexis 3y ago
If you used a per-user list-wide salt, there wouldn't be any scaling issues.
And the requirements themselves dictate that there's a small search space.
- ryan-c 3y agoIf you used a per-user-list salt, then it would be about as useful as obfuscating phone numbers by hashing them. The list must then be enumerable in N*x time, where x is the time to hash one user, and N is the cardinality of the search space. One second per legitimate hash check? You can enumerate the list in a few hours by doing a parallel search...