Difference between revisions of "WEP Cracking"
From ivc wiki
Jump to navigationJump to search
Line 17: | Line 17: | ||
== Way of attack == | == Way of attack == | ||
This is the most efficient method to crack a WEP protected network. The attack can be performed in under a minute. The result is the WEP hex/ascii-key used. | |||
* '''WEP encryption''': | * '''WEP encryption''': | ||
# 24-bit unencrypted initialization vector + 104-bit key (13 characters/bytes), 128-bit key | # 24-bit unencrypted initialization vector + 104-bit key (13 characters/bytes), 128-bit key |
Revision as of 23:05, 26 August 2009
WEP is infamously known as the broken wireless security protocol. A design flaw was discovered in 2001 and after several cascading discoveries it's now possible to crack a WEP protected network within minutes. WPA is the successor to WEP and features a better but not perfect security protocol.
Background
There are now many sources that describe the vulnerability in detail and APR replay to generate traffic, but this is a short summary. For an throughout explaination on how WEP is implemented and the vulnerabilities, see the link below.
Types attacks:
- Passive attacks to decrypt traffic based on statistical analysis.
- Active attack to inject new traffic from unauthorized mobile stations, based on known plaintext.
- Active attacks to decrypt traffic, based on tricking the access point.
- Dictionary-building attack that, after analysis of about a day's worth of traffic, allows real-time automated decryption of all traffic.
Original discoveries and paper:
- (In)security of the WEP algorithm by Nikita Borisov, Ian Goldberg, and David Wagner
- Intercepting Mobile Communications:The Insecurity of 802.11 paper
Way of attack
This is the most efficient method to crack a WEP protected network. The attack can be performed in under a minute. The result is the WEP hex/ascii-key used.
- WEP encryption:
- 24-bit unencrypted initialization vector + 104-bit key (13 characters/bytes), 128-bit key
- Used to generate RC4 cipher stream
- XOR the message
- Encrypted network packets
- ARP replay:
- On the basis that the first 12-bytes of ARP packets always stays the same
- Capture one ARP packet
- Inject back to into the network to stimulate traffic
- Capture 10-20 000 ARP (or other data) packets
- Key attack:
- Find Initialization Vector collisions where two cipher texts (12-bytes ARP) are the same (only 2^24 possibilities)
- XOR back first 12-bytes using the known plain-text ARP data
- RC4 stream cipher is revealed for that specific IV
- Find enough collisions
- Data used to build a table of Initialization Vectors and RC4 stream ciphers
- Use table to gain a statistical factor for the remainder missing key bytes, 104-bit (13 character) key