http://www.perlmonks.org?node_id=282179


in reply to Re: Re: Re: Minimal password checking: a summary
in thread Minimal password checking: a summary

You are still assuming that a unique mapping is possible, but it isn't.

I investigated a little about what symbols and numbers people use to substitute to alphabetic characters, and I had this table:

a/A: @,4 b/B: 6,8,& d/D: 0 e/E: 3,& f/F: # g/G: 9 h/H" # i/I: 1,l j/J: 1 l/L: 1 o/O: 0 p/P: 9 q/Q: 9 s/S: $,5 t/T: + z/Z: 2,7,%

As you can see, a single letter can map to three characters, and a single symbol can map to many characters...

A solution could be a junction, but we are speaking about Perl 5, and junctions will come with Perl 6... Any Perl 5 solution of this problem?

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

Replies are listed 'Best First'.
Re: Re: Re: Re: Re: Minimal password checking: a summary
by larsen (Parson) on Aug 08, 2003 at 13:45 UTC
    A solution could be a junction, but we are speaking about Perl 5, and junctions will come with Perl 6... Any Perl 5 solution of this problem?

    Junctions are called Quantum::Superpositions in Perl 5 :)