+- hashcat Forum (https://hashcat.net/forum)
+-- Forum: Support (https://hashcat.net/forum/forum-3.html)
+--- Forum: hashcat (https://hashcat.net/forum/forum-45.html)
+--- Thread: Cracking Captured File (/thread-12035.html)
Cracking Captured File - Metju - 06-19-2024
Hi so I recently tried to use hashcat to crack a wifi password with the following command:
hashcat.exe -m 22000 hash.hc22000 -1 ?d?l?u -a 3 ?1?1?1?1?1?1?1?1?1?1?1?1
but the output shows the same error over and over:
OpenCL API (OpenCL 3.0 CUDA 12.5.78) - Platform #1 [NVIDIA Corporation]
=======================================================================
* Device #1: NVIDIA GeForce RTX 4060, 8064/8187 MB (2046 MB allocatable), 24MCU
Minimum password length supported by kernel: 8
Maximum password length supported by kernel: 63
Hashes: 1 digests; 1 unique digests, 1 unique salts
Bitmaps: 16 bits, 65536 entries, 0x0000ffff mask, 262144 bytes, 5/13 rotates
Optimizers applied:
* Zero-Byte
* Single-Hash
* Single-Salt
* Brute-Force
* Slow-Hash-SIMD-LOOP
Watchdog: Temperature abort trigger set to 90c
Host memory required for this attack: 1475 MB
Integer overflow detected in keyspace of mask: ?1?1?1?1?1?1?1?1?1?1?1?1
Started: Wed Jun 19 00:30:49 2024
Stopped: Wed Jun 19 00:30:53 2024
I dont know what to do with it, can anybody please help me resolve this?
RE: Cracking Captured File - penguinkeeper - 06-19-2024
The charset you defined is ?d?l?u, which is 10+26+26 possible characters. If you then take the length of your mask in characters, 12, the total amount of passwords your attack would be trying is (10 + 26 + 26) ^ 12, which is roughly 3226266762397899821056 candidate passwords, which is completely impossible to search, hence why Hashcat isn't even trying to start, because the attack wouldn't even finish in 100 lifetimes.
RE: Cracking Captured File - Metju - 06-19-2024
(06-19-2024, 01:16 AM)penguinkeeper Wrote: The charset you defined is ?d?l?u, which is 10+26+26 possible characters. If you then take the length of your mask in characters, 12, the total amount of passwords your attack would be trying is (10 + 26 + 26) ^ 12, which is roughly 3226266762397899821056 candidate passwords, which is completely impossible to search, hence why Hashcat isn't even trying to start, because the attack wouldn't even finish in 100 lifetimes.
Oh that makes sense. Thanks for your answer.