this post was submitted on 21 May 2026
1 points (100.0% liked)
cybersecurity
6452 readers
2 users here now
An umbrella community for all things cybersecurity / infosec. News, research, questions, are all welcome!
Community Rules
- Be kind
- Limit promotional activities
- Non-cybersecurity posts should be redirected to other communities within infosec.pub.
Enjoy!
founded 3 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
WEP was even easier than this, as you could directly sniff the password. This method works with WPA/WPA2, which is what most wifi networks are on.
Really? ISTR I had to wait until enough traffic accumulates, then run some aircrack-ng computation, to make it happen, on WEP, and WPA was crackproof. Oh well, I must be misremembering, or maybe times have moved on.
Both attacks need to wait a while while sniffing traffic, because they want to capture auth frames.
In the case of WPA, the periodic auth frames aren't enough to crack the password, so you need a full auth frame. Those full frames get sent when a device connects to the network, and you need to be listening at that same moment in order to catch it (which is why it takes a while). Tools like aircrack-ng can, additionally, do deauth attacks, which temporarily log a target device off the network. This prompts an immediate automatic log in again, that the user doesn't even notice, but which sends the full auth frame with the PSK.
Once you have a PSK, you can crack it with john or hashcat (hashcat is faster, because of GPU acceleration). Strong passwords will be uncrackable, but you do have a chance with small or common passwords. With a relatively mid-low range PC, you can easily get millions of hashes per second, making large dictionaries (12B+ passwords) feasible. If you have an idea of what the password could be (name of the company with maybe a year at the end that will probably be within the last 10 years, for example), it's trivial to check all possible combinations. Bruteforcing is also possible, but it will be limited to 8-9 characters in length (12-13 if only numerical) before becoming unfeasible.