decoration decoration
Stories

GROKLAW
When you want to know more...
decoration
For layout only
Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines
ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

Click here to send an email to the editor of this weblog.


You won't find me on Facebook


Donate

Donate Paypal


No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.


What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments


Sponsors

Hosting:
hosted by ibiblio

On servers donated to ibiblio by AMD.

Webmaster
Collision with dictionary words seems unlikely | 248 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
Collision with dictionary words seems unlikely
Authored by: Anonymous on Wednesday, August 22 2012 @ 06:52 AM EDT
I haven't done the math, but I think you would have to be
phenomenally unlucky for your complex long password to have
a hash collision with a dictionary word...

Simply put, there are vastly more combinations of complex
(caps, lower, numbers and symbols, or non dictionary word)
passwords available than there are dictionary words - which
is one of the reasons to use a long complex passphrase.

Collisions do exist, so it's technically possible, but then
it's technically possible to guess a 128 / 256bit secret key
without even bothering to attack the password.

I think it's currently very challenging to find *any*
collisions in SHA1, so it seems wildly unlikely to start
with an arbitrary "random" passcode and find a collision
with the (vastly reduced set of) short obvious dictionary
words.

I'm not sure I'll be losing much sleep on that idea, but
then I'm not James Bond. Mileage may vary.

[ Reply to This | Parent | # ]

Not a credible threat
Authored by: scav on Wednesday, August 22 2012 @ 08:54 AM EDT
A SHA1 hash is 160 bits long. So at a first approximation,
the chance of your password hashing to the same as "password"
is one in 2^160. You can worry about odds like that if you
want ;)

Also, the hash should be of your password and a randomly
chosen per-user salt value, so that two people with the same
password will still have different hashes. There's no
computationally-feasible way to attack a list of such salted
hashes even if you know the salt and hash for each one.

---
The emperor, undaunted by overwhelming evidence that he had no clothes,
redoubled his siege of Antarctica to extort tribute from the penguins.

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )