Briefly explain how WEP implementation violates the cardinal rule of cryptography: anything that creates a detectable pattern must be avoided.

What will be an ideal response?


WEP implementation violates the cardinal rule of cryptography: anything that creates a detectable pattern must be avoided. This is because patterns provide an attacker with valuable information to break the encryption. The implementation of WEP creates a detectable pattern for attackers. IVs are 24-bit numbers, meaning there are 16,777,216 possible values. An AP transmitting at only 11 Mbps can send and receive 700 packets each second. If a different IV were used for each packet, then the IVs would start repeating in fewer than seven hours (a "busy" AP can produce duplicates in fewer than five hours). An attacker who captures packets for this length of time can see the duplication and use it to crack the code.

Yet it does not always require seven hours of capturing packets to see the IV repeat. Some wireless systems always start with the same IV after the system is restarted and then follow the same sequence of incrementing IVs.

Computer Science & Information Technology

You might also like to view...

When you ________ a variable, you assign it a starting value that may be changed later if necessary

Fill in the blank(s) with correct word

Computer Science & Information Technology

When you relate tables, Access uses a set of rules to ensure that there are matching values in the common field used to form the relationship, both at the time you create the relationship and as you enter data in the tables after you create the relationship. This set of rules is called ____.

A. referential integrity B. security rules C. match conditions D. field rules

Computer Science & Information Technology

What form property allows you to specify the caption of the Form in the title bar?

A. Name B. property C. Text D. label

Computer Science & Information Technology

Heap sort begins by ____.

A. doing a selection sort B. scanning the array, looking for its largest element C. scanning the array, looking for its smallest element D. turning the array to be sorted into a heap

Computer Science & Information Technology