Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Minimal password check, again

by Limbic~Region (Chancellor)
on Jul 27, 2003 at 17:12 UTC ( [id://278240]=note: print w/replies, xml ) Need Help??


in reply to Minimal password check, again

bronto,
I am not sure why eliminating too many repeated characters is a requirement, but here is a node that was a contest to find the most efficient way to get the number of unique characters in a string. From a brute force perspective - it is no easier to crack the password abcde then it is ppppp.

As far as identifying repeating sequence of characters, I do not know of an efficient method to do this, but:

  • Use substr with various lengths and starting positions
  • Use my $count = $temp_pass =~ s/$substring//g

    To get the count of how often the sequence repeats in the password. Again, I do not understand the point of this.

    I hope this helps - L~R

  • Log In?
    Username:
    Password:

    What's my password?
    Create A New User
    Domain Nodelet?
    Node Status?
    node history
    Node Type: note [id://278240]
    help
    Chatterbox?
    and the web crawler heard nothing...

    How do I use this?Last hourOther CB clients
    Other Users?
    Others making s'mores by the fire in the courtyard of the Monastery: (2)
    As of 2024-04-26 00:25 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      No recent polls found