Ethical Hacking

Learn to find vulnerabilities before the bad guys do! Gain real world hands on hacking experience in our state of the art hacking lab. Course designed and taught by expert instructors with years of penetration testing experience. 12 student maximum in every class. Certification attempt included in every package.
Computer Forensics Training at InfoSec Institute

Gain the in-demand skills of a certified computer examiner, learn to recover trace data left behind by fraud, theft, and cybercrime perpetrators. Discover the source of computer crime and abuse at your organization so that it never happens again. All of our class sizes are guaranteed to be 12 students or less to facilitate one-on-one interaction with one of our expert instructors.




Network Security Focus-Microsoft
[Top] [All Lists]

RE: Password complexity - improvement

Subject: RE: Password complexity - improvement
Date: Fri, 17 Aug 2007 22:46:07 +0100
Thor, et al

Your statement:

"You have to "crack" the hash in singularity..."

Is only partially true. I've noticed that LC5 is capable of quickly cracking
the first "half" of an LM password consisting of two 7 digit words
concantenated, provided that the first word is in its dictionary. Of course,
the LM password is not as secure, so all the better to go for passphrases.

Cheers

James
James D. Stallard, MIoD
Infrastructure Technical Architect
Web: www.leafgrove.com
LinkedIn: www.linkedin.com/in/jamesdstallard

-----Original Message-----
From: listbounce@securityfocus.com [mailto:listbounce@securityfocus.com] On
Behalf Of Thor (Hammer of God)
Sent: 16 August 2007 22:07
To: Ansgar -59cobalt- Wiechers; focus-ms@securityfocus.com
Subject: RE: Password complexity - improvement

Ah.... NOW I see what you mean... As in, if you required all 4 complexity
requirements, and you knew the first three characters were Aa1, then you'd
know for a fact that the last character had to be a "special" character...

Only problem with that is that a BF attack does not give us one character at
a time. You have to "crack" the hash in singularity...
meaning that your BF attempt would not be able to discern that the first
3 were Aa1 in order to only try special characters for the 4th.  Nor do you
know how long the password is, so you'd have to try all possible characters
for each column.  Which means, the more keyspace == more combinations again.
This is particularly true when you consider that requiring ALL complexity
requirements does not preempt one from using more than one as in
Aa11aA$$$%%%Aa11.  So, even knowing the complexity rules are in place don't
really help you.

Interesting thread, though.

t

-----Original Message-----
From: listbounce@securityfocus.com
[mailto:listbounce@securityfocus.com] On Behalf Of Ansgar -59cobalt- 
Wiechers
Sent: Thursday, August 16, 2007 11:08 AM
To: focus-ms@securityfocus.com
Subject: Re: Password complexity - improvement

Bruce,

On 2007-08-16 Bruce K. Marshall wrote:
Requiring users to create a password of uppercase, lowercase,
numbers,
and symbols encourages stronger passwords, not weaker ones.  The
loss
of possible password choices is negligible and has no negative
impacts
other than on the usability of the passwords themselves.  I'll be 
happy to share the math backing this up if you really want to argue 
the point.

I do not agree that the loss of possible passwords is necessarily 
negligible. I'd like to see the math to back up this assumption. And
in
any case the decrease of the total amount of possible passwords does
by
definition mean you have a negative impact on security. The impact may 
indeed be negligible, but you still need to be aware of the fact to 
make the distinction.

Besides, even complexity requirements can't replace user education. A 
password like "b@n4Na" would be compliant to the policy in question
and
still susceptible to dictionary attacks.

Regards
Ansgar Wiechers
--
"The Mac OS X kernel should never panic because, when it does, it 
seriously inconveniences the user."
--http://developer.apple.com/technotes/tn2004/tn2118.html


<Prev in Thread] Current Thread [Next in Thread>