you accept a1@a1@ba1@a1@, but reject a1@a1@ba1@a1@b
Yes, unfortunately
IMO, if you want to do something with the repeatedness, you should only test the first N characters, where N is minimum amount of characters allowed.
I don't agree. In fact, if you use ba1@a1@a1@a1@b you are stuck again with the same problem: the password is full of similar characters, but... acceptable. To make things work better you could check all N-wide windows of the password for repetitions (that is, for N=6, ba1@a1, a1@a1@, 1@a1@a...). So if password is M > N long, you should check the M-N N-wide sections of the passwords, or, better and safer, the first N characters of each of the M rotations of the password itself...
Would it be computationally affordable? Should check...
Ciao!
--bronto
The very nature of Perl to be like natural language--inconsistant and full of dwim and special cases--makes it impossible to know it all without simply memorizing the documentation (which is not complete or totally correct anyway).
--John M. Dlugosz
In reply to Re: Re: Basic password checking
by bronto
in thread Basic password checking
by bronto
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |