Posts: 33
Threads: 11
Joined: May 2020
10-10-2021, 08:13 PM
(This post was last modified: 10-10-2021, 08:47 PM by MA40.)
Hello.
1.- Just when starting HashCat, the speed is much higher than after a while when it stabilizes, (three or four times higher); then it stabilizes. What is the reason for this?
2.- Suppose we have a list of 100 hashes. What is faster? Launching an attack one at a time or launching an attack against a file with all 100 hashes at once? Or is it indifferent?
All the best.
Posts: 103
Threads: 2
Joined: Jul 2016
10-10-2021, 10:39 PM
(This post was last modified: 10-10-2021, 10:41 PM by drsnooker.)
2) is an easy experiment to try and find out by combining two and check the time. (and please do report back to us!) If the hash is salted there didn't seem to be much value in combining them.
Posts: 33
Threads: 11
Joined: May 2020
(10-10-2021, 10:39 PM)drsnooker Wrote: 2) is an easy experiment to try and find out by combining two and check the time. (and please do report back to us!) If the hash is salted there didn't seem to be much value in combining them.
Hello.
First I have launched a "Bitcoin/Litecoin wallet.dat" attack against a single hash; and the speed results are as follows:
When starting the attack, the speed is: 1900 H/s.
After several hours, when the speed stabilizes: 1900 H/s.
Then I launched a "Bitcoin/Litecoin wallet.dat" attack against a file with 87 hashes; and the speed results are as follows:
When starting the attack, the speed is: 5800 H/s.
After several hours, when the speed stabilizes: 1600 H/s.
I don't understand that speed difference in the attack against the 87 hashes at the start and after several hours. Can anyone explain it?
Could I take advantage of the startup speed on the 87 hashes by starting the HashCat after every "Restore.Point"?
All the best.
Posts: 33
Threads: 11
Joined: May 2020
10-20-2021, 03:34 PM
(This post was last modified: 10-21-2021, 07:25 PM by MA40.)
Hello.
If I'm not wrong, the speed of a "Bitcoin / Litecoin wallet.dat" attack against a hash is inversely proportional to its number of iterations. Correct?
For example, the speed against a hash with 100,000 iterations is twice as fast as against another with 200,000. This is correct?
Well then, it is difficult to analyze the speeds against a file with multiple hashes; but what I don't understand is why there is such a big difference when starting the attack and after a few hours, when the speed has stabilized.
Can't someone help me please?
All the best.
