![]() Is it simple a matter of a more refined algorythm for JTR? If so any deeper details would be greatly appreciated. So my question is, why is JTR so superior in this scenario? As I understand both methods were using CPU over GPU since its bcrypt. That makes JTR more than twice as fast as indicted by the hashing speeds. JTR was able to crack that hash in 7 min, 3 secs, whilst hashcat tool 15 mins, 11 secs. When cracking the hash with john the ripper I used the following command: john -format=bcrypt -wordlist=rockyou.txt hashes.txtĭuring the attempt JTR reported a speed of: 111.4p/s 111.4c/s 111.4C/s rockyou.txtĭuring the attempt hashcat reported a speed of: 52 H/s (3.91ms). For example, it could be trying to crack a password from a password file. When trying to crack with hashcat I used the following command to attempt to crack the hash: hashcat.exe -a 0 -m 3200 hashes.txt. Hashcat can be used to discover lost passwords, or as part of a security assignment. I was tasked to crack the following hash: $2y$10$0veO/.d3p12kBtZutm To keep it short I've recently been learning about hashing and password hash cracking on TryHackMe.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |