Re: Password question
From: Tony Lawrence (foo_at_pcunix.com)
Date: 05/18/05
- Next message: crozewski_at_gmail.com: "Re: Password question"
- Previous message: Ari Silversteinn: "Re: Password question"
- In reply to: tewall_at_lycos.com: "Password question"
- Next in thread: crozewski_at_gmail.com: "Re: Password question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 18 May 2005 16:57:16 -0400
tewall@lycos.com wrote:
> 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)
>
Why don't you use something like John the Ripper and find out how long
it does take?
-- Tony Lawrence Unix/Linux/Mac OS X resources: http://aplawrence.com
- Next message: crozewski_at_gmail.com: "Re: Password question"
- Previous message: Ari Silversteinn: "Re: Password question"
- In reply to: tewall_at_lycos.com: "Password question"
- Next in thread: crozewski_at_gmail.com: "Re: Password question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
