Password question

tewall_at_lycos.com
Date: 05/18/05 

Date: 18 May 2005 13:15:23 -0700

Say I have a password like JenP4$$4PlayerS. I understand this is a bad
(i.e. not strong) password for a number of reasons. It has
combinations of words, abbreviations and palindromes. My question is,
given that all 15 characters have to be used (that is, the password
can't be split into smaller units, like 7 digits) even if you can split
out the pieces of the words, palindromes and abbreviation, if there's
say a million each of these, you take a million cubed, and that's still
a very large number. So how weak is a password like this? What kind
of resources would it take to break? (rough approximation)

Relevant Pages

  • Re: Password question
    ... > password for a number of reasons. ... > combinations of words, abbreviations and palindromes. ... Unix/Linux/Mac OS X resources: http://aplawrence.com ...
    (comp.security.misc)
  • Re: Password question
    ... > password for a number of reasons. ... > combinations of words, abbreviations and palindromes. ... http://www.garlic.com/~lynn/2001d.html#52 OT Re: A beautiful morning in AFM. ...
    (comp.security.misc)
  • Re: derangement: code review request
    ... It's still an abbreviation, and avoiding abbreviations would ... Or are you saying you've considered all possible reasons ... >> the spacing style used above is something Richard Bos is unaccustomed ... Weak because the spacing in the prose text example is ...
    (comp.lang.c)
  • Re: Hungarian Notation
    ... And for exactly the same reasons that it gets unmanageable it is always somewhat more difficult to read - there is a scale of difficulty from not very to damn near impossible. ... Abbreviations are almost always harder to understand than the word or words that they are abbreviating. ... "CustomerCombo" and "CustomerComboBox" in the same code is better than "cbCustomer" and "cmbCustomer" in the same code. ... Now, while I would regard any perceived benefit as highly dubious, I would not claim that you do not get any. ...
    (borland.public.delphi.non-technical)