DisturbeR
30.07.2007, 00:55
Набрел случайно на заметку, на нерусском языке, текст ниже в оригинале. В двух словах, автор утверждает, что простое упорядочивание соленых хешей дает прирост скорости JTR в 20%. Проверьте кому несложно, а то у меня сейчас ни времени, ни тех.базы нет.
(Подозрение, что это особый буржуинский юмор, но знаний английского не хватает до понимания этих тонкостей :) :) :) )
The thread:
================================================== =========
Ok, this is a test that i did.
You can see in online john documentation that:
Sometimes it is useful to split your password hashes into two sets which you crack separately, like:
john --wordlist=all.lst --rules --salts=2 *passwd*
john --wordlist=all.lst --rules --salts=-2 *passwd*
"This will make John try salts used on two or more password hashes first and then try the rest. Total cracking time will be almost the same, but you will get some passwords cracked earlier
So, john will "choose" the salts of some pre-defined number of hashes, try to decript that, what can speed the process.
I think we all agreed about that, because its from the author, what the hell.
The question is: they say its cant speed up the entire crack proccess, but just split up some passes
faster.
So, thinking in that words, i did a test.
I get the same passfile and just runed john in this way:
(first try)
{john -i:digits mypf.txt} what gave me this result after 50 secs:
guesses: 0 time: 0:00:00:50 c/s: 41214002 trying: 12667726 - 04333438
And so, after i stoped the session, i opened the mypf.txt in excell and I classified
the hashes by colum "b" what put all my 6 salts (that pf has just 6 salts) in order.
So, i runned again john with the same syntax:
{john -i:digits mypf.txt} and after the same 50 secs of run it show me:
c/s: 48524725
so, depends of so many hashes and salts you have in your targed pf, i think iis a good idea to do the same, since, it seems to increase the speed in 20% or more.
Of course it depends of more tests but i just want to let you all know.
Cheers, Troler.
================================================== ========
and one follow-up from me:
================================================== ========
Ok, some news...what i dont do in name of science? i did a test with one and other list (there are no passes to crack in the lists).
The normal list took me 70 minutes of my life.
The second one (pass classified list) took me 54 minutes (just stoped/finished).
So, i think is a good idea to think about to use this method some time.
And everytime you do, i want my copyrights.
Cheers, Troler.
================================================== ========
EOF.
(Подозрение, что это особый буржуинский юмор, но знаний английского не хватает до понимания этих тонкостей :) :) :) )
The thread:
================================================== =========
Ok, this is a test that i did.
You can see in online john documentation that:
Sometimes it is useful to split your password hashes into two sets which you crack separately, like:
john --wordlist=all.lst --rules --salts=2 *passwd*
john --wordlist=all.lst --rules --salts=-2 *passwd*
"This will make John try salts used on two or more password hashes first and then try the rest. Total cracking time will be almost the same, but you will get some passwords cracked earlier
So, john will "choose" the salts of some pre-defined number of hashes, try to decript that, what can speed the process.
I think we all agreed about that, because its from the author, what the hell.
The question is: they say its cant speed up the entire crack proccess, but just split up some passes
faster.
So, thinking in that words, i did a test.
I get the same passfile and just runed john in this way:
(first try)
{john -i:digits mypf.txt} what gave me this result after 50 secs:
guesses: 0 time: 0:00:00:50 c/s: 41214002 trying: 12667726 - 04333438
And so, after i stoped the session, i opened the mypf.txt in excell and I classified
the hashes by colum "b" what put all my 6 salts (that pf has just 6 salts) in order.
So, i runned again john with the same syntax:
{john -i:digits mypf.txt} and after the same 50 secs of run it show me:
c/s: 48524725
so, depends of so many hashes and salts you have in your targed pf, i think iis a good idea to do the same, since, it seems to increase the speed in 20% or more.
Of course it depends of more tests but i just want to let you all know.
Cheers, Troler.
================================================== ========
and one follow-up from me:
================================================== ========
Ok, some news...what i dont do in name of science? i did a test with one and other list (there are no passes to crack in the lists).
The normal list took me 70 minutes of my life.
The second one (pass classified list) took me 54 minutes (just stoped/finished).
So, i think is a good idea to think about to use this method some time.
And everytime you do, i want my copyrights.
Cheers, Troler.
================================================== ========
EOF.