Graphics Programs Reference
In-Depth Information
in a matter of minutes under the assumption of 10,000 cracks per second
(and in a matter of seconds on a modern processor). More information on
his methods can be found at http://www.lava.net/~newsham/wlan.
For 104-bit (marketed as 128-bit) WEP networks, brute-forcing just isn't
feasible.
0x782
Keystream Reuse
Another potential problem with WEP lies in keystream reuse. If two
plaintexts (
P
) are XORed with the same keystream to produce two separate
ciphertexts (
C
), XORing those ciphertexts together will cancel out the
keystream, resulting in the two plaintexts XORed with each other.
C
1
=
P
1
⊕ RC4(seed)
C
2
=
P
2
⊕ RC4(seed)
C
1
⊕
C
2
= [
P
1
⊕ RC4(seed)] ⊕ [
P
2
⊕ RC4(seed)] =
P
1
⊕
P
2
From here, if one of the plaintexts is known, the other one can easily be
recovered. In addition, since the plaintexts in this case are Internet packets
with a known and fairly predictable structure, various techniques can be
employed to recover both original plaintexts.
The IV is intended to prevent these types of attacks; without it, every
packet would be encrypted with the same keystream. If a different IV is used
for each packet, the keystreams for packets will also be different. However, if
the same IV is reused, both packets will be encrypted with the same keystream.
This is a condition that is easy to detect, since the IVs are included in plaintext
in the encrypted packets. Moreover, the IVs used for WEP are only 24 bits in
length, which nearly guarantees that IVs will be reused. Assuming that IVs
are chosen at random, statistically there should be a case of keystream reuse
after just 5,000 packets.
This number seems surprisingly small due to a counterintuitive prob-
abilistic phenomenon known as the
birthday paradox
. This paradox states that
if 23 people are in the same room, two of these people should share a birthday.
With 23 people, there are (23 · 22) / 2, or 253, possible pairs. Each pair has a
probability of success of 1/365, or about 0.27 percent, which corresponds to
a probability of failure of 1 − (1 / 365), or about 99.726 percent. By raising
this probability to the power of 253, the overall probability of failure is shown
to be about 49.95 percent, meaning that the probability of success is just a
little over 50 percent.
This works the same way with IV collisions. With 5,000 packets, there are
(5000 · 4999) / 2, or 12,497,500, possible pairs. Each pair has a probability of
failure of 1 − (1 / 2
24
). When this is raised to the power of the number of
possible pairs, the overall probability of failure is about 47.5 percent, meaning
that there's a 52.5 percent chance of an IV collision with 5,000 packets:
5 000
,
⋅
2
4 999
,
-------------------
11
1
2
24
⎛
⎞
=
52.5Ψ
-
-
----
⎝
⎠
