[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <4E08445A.2060704@gmail.com>
Date: Mon, 27 Jun 2011 10:50:34 +0200
From: Bartavelle <bartavelle@...il.com>
To: john-users@...ts.openwall.com
Subject: Re: brute force attack of an Unix crypt
On 27/06/2011 10:47, Bartavelle wrote:
> On 27/06/2011 01:06, Martin T wrote:
>> [Incremental:All8]
>> File = /usr/share/john/all.chr
>> MinLen = 8
>> MaxLen = 8
>> CharCount = 95
>>
>> I remember that I really used letters, numbers and special
>> characters(8 characters in total) in order to generate this crypt
>> file. I even found the terminal where I started this command and if I
>> pressed enter few times, following was printed to the terminal:
>>
>> guesses: 0 time: 139:15:12:09 c/s: 930654 trying: l5rBse_N - l5rBsil$
>> guesses: 0 time: 141:15:32:12 c/s: 929241 trying: 1doccLl4 - 1doccLur
>> guesses: 0 time: 141:15:32:15 c/s: 929241 trying: 1dau4qf! - 1dau4qwp
>> guesses: 0 time: 141:15:34:21 c/s: 929241 trying: 1jeTL x8 - 1jeTL e#
>> guesses: 0 time: 141:18:48:12 c/s: 929072 trying: 2kageA3z - 2kageACs
>>
>> How much longer it might take to decrypt this Unix crypt?
>
> If all 95^8 passwords were tested, it would take at most 226 years to
> complete. However, -inc doesn't test all passwords, so it might never end.
It meant it might never find it, the cracking job will eventually end.
But it is much more likely your motherboard will burn before that.
Powered by blists - more mailing lists
Confused about mailing lists and their use?
Read about mailing lists on Wikipedia
and check out these
guidelines on proper formatting of your messages.
