this post was submitted on 27 Jul 2023
1466 points (98.2% liked)

Memes

44907 readers
2774 users here now

Rules:

  1. Be civil and nice.
  2. Try not to excessively repost, as a rule of thumb, wait at least 2 months to do it if you have to.

founded 5 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 6 points 1 year ago (1 children)

But you need to know previous password if the objective is to make sure there's at least two characters difference compared to new password

[–] [email protected] 0 points 1 year ago (2 children)
[–] [email protected] 3 points 1 year ago* (last edited 1 year ago)

I mean "because password hashes" is basically my original rational so not sure it qualifies as a counter argument.

But the link you provide is more explicit:

When the user enters the new password, the system generates the variations of the new password entered, hashes each one of them, and compares each hash against the old password's hash. If any of the hash matches, it throws an error. Else, it successfully changes the password

It is possible to hash all 1 character variations I guess, I kinda doubt that it is done often (does anyone know a library?).

I guess complexity increases linearly so password length is might not severely limit this mechanism. It would be interesting to see a calculation of how long it takes for a long password can to calculate all possibilities for 1 char variations for utf-8 or other charsets

Thanks for sharing the link!