john-users - Re: Using a pre-computed list of alphanumeric strings. (not rainbow tables)

Openwall Project		/home Owl JtR Pro crypt pam_passwdqc tcb phpass scanlogd popa3d msulogin / Linux BIND / advisories presentations / services donations / wordlists passwords / NEWS community lists Wiki CVSweb mirrors signatures
bringing security into open environments

Password Recovery Resources on the Net

[<prev] [next>] [<thread-prev] [thread-next>] [month] [year] [list]

Date: Tue, 29 Aug 2006 09:18:54 +0200
From: Simon Marechal <simon@...quise.net>
To: john-users@...ts.openwall.com
Subject: Re: Using a pre-computed list of alphanumeric strings.
 (not rainbow tables)

John wrote:

> to pre-compute a 'list' of every possible alphanumeric combination 
> untill 14

14 chars numeric *only* passwords (123, 123456, ...) are quite numerous 
(10^14 :) ). And that's without counting 13 chars, 12 chars, ... passwords.

If the hash is 16 bytes long, you end up using 16*10^14 bytes, about 
1455To. And you would have to generate that for every salt.

[ CONTENT OF TYPE application/x-pkcs7-signature SKIPPED ]