hash-password check order in straight attack
#1
What is the order of hash-password checking in case of straight/dictionary attack?
What is the operating principle of hashcat?

Lets's say I have 10 hashes:
hash1
hash2
hash3
etc.

My dictionary contains password1 to password100:
password1
password2
password3
etc..

Hashcat take the 1st hash (hash1) and then try all the password from password1 to password100, then take the 2nd hash (hash2) then try all the password again from password1 to password 100, etc..?

or hashcat take the first password (password1) and try to find match from hash1 to hash100,
than take the second password (password2) and try to find match from hash1 to hash100, etc...

Could you explain it or send a link for the answer?

Thank you.
#2
The ordering of a wordlist based attack is not changed, but the processes is a parallel one. That means hashcat creates a chunk based on the several factors and process them in parallel. When it's finished, it grabs the next chunks, and so on
#3
(10-01-2017, 11:32 AM)atom Wrote: The ordering of a wordlist based attack is not changed, but the processes is a parallel one. That means hashcat creates a chunk based on the several factors and process them in parallel. When it's finished, it grabs the next chunks, and so on
Thanks the info.