1 Wireless Threats 1 – Cracking WEP Cracking WEP in Chapter 5 of Wireless Maximum Security by Peikari, C. and Fogie, S.

Slides:



Advertisements
Similar presentations
Modern Symmetric-Key Ciphers
Advertisements

Wireless Security By Robert Peterson M.S. C.E. Cryptographic Protocols University of Florida College of Information Sciences & Engineering.
Encryption/Decyprtion using RC4 Vivek Ramachandran.
WEP 1 WEP WEP 2 WEP  WEP == Wired Equivalent Privacy  The stated goal of WEP is to make wireless LAN as secure as a wired LAN  According to Tanenbaum:
Wireless Security Ryan Hayles Jonathan Hawes. Introduction  WEP –Protocol Basics –Vulnerability –Attacks –Video  WPA –Overview –Key Hierarchy –Encryption/Decryption.
1 MD5 Cracking One way hash. Used in online passwords and file verification.
WEP Weaknesses Or “What on Earth does this Protect” Roy Werber.
Intercepting Mobiles Communications: The Insecurity of Danny Bickson ACNS Course, IDC Spring 2007.
How To Not Make a Secure Protocol WEP Dan Petro.
The Trouble with WEP Or, cracking WiFi networks for fun & profit (not really) Jim Owens.
Wired Equivalent Privacy (WEP)
Security in Wireless LAN Layla Pezeshkmehr CS 265 Fall 2003-SJSU Dr.Mark Stamp.
RC4 1 RC4 RC4 2 RC4  Invented by Ron Rivest o “RC” is “Ron’s Code” or “Rivest Cipher”  A stream cipher  Generate keystream byte at a step o Efficient.
Wireless Security Presentation by Paul Petty and Sooner Brooks-Heath.
EECC694 - Shaaban #1 lec #16 Spring Properties of Secure Network Communication Secrecy: Only the sender and intended receiver should be able.
The Final Nail in WEP’s Coffin Andrea Bittau, Mark Handley – University College London Joshua Lackey - Microsoft CPS372 Gordon College.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 5 Wenbing Zhao Department of Electrical and Computer Engineering.
15 November Wireless Security Issues Cheyenne Hollow Horn SFS Presentation 2004.
WIRELESS NETWORK SECURITY. Hackers Ad-hoc networks War Driving Man-in-the-Middle Caffe Latte attack.
Module-8 Wireless LAN Security ,Vulnerabilities and Attack Methods
Encryption is a way to transform a message so that only the sender and recipient can read, see or understand it. The mechanism is based on the use of.
WLAN What is WLAN? Physical vs. Wireless LAN
Mobile and Wireless Communication Security By Jason Gratto.
CSC-682 Advanced Computer Security
CWNA Guide to Wireless LANs, Second Edition Chapter Eight Wireless LAN Security and Vulnerabilities.
“Security Weakness in Bluetooth” M.Jakobsson, S.Wetzel LNCS 2020, 2001 The introduction of new technology and functionality can provides its users with.
Modes of Operation. Topics  Overview of Modes of Operation  EBC, CBC, CFB, OFB, CTR  Notes and Remarks on each modes.
A History of WEP The Ups and Downs of Wireless Security.
Network Security. Security Threats 8Intercept 8Interrupt 8Modification 8Fabrication.
COEN 350 Mobile Security. Wireless Security Wireless offers additional challenges: Physical media can easily be sniffed. War Driving Legal? U.S. federal.
Wireless Insecurity By: No’eau Kamakani Robert Whitmire.
Done By : Ahmad Al-Asmar Wireless LAN Security Risks and Solutions.
Intercepting Mobile Communications: The Insecurity of Nikita Borisov Ian Goldberg David Wagner UC Berkeley Zero-Knowledge Sys UC Berkeley Presented.
Wireless Security Presented by: Amit Kumar Singh Instructor : Dr. T. Andrew Yang.
Types of Electronic Infection
Stream Cipher July 2011.
NSRI1 Security of Wireless LAN ’ Seongtaek Chee (NSRI)
WEP Protocol Weaknesses and Vulnerabilities
COEN 350 Mobile Security. Wireless Security Wireless offers additional challenges: Physical media can easily be sniffed. War Driving Legal? U.S. federal.
WEP AND WPA by Kunmun Garabadu. Wireless LAN Hot Spot : Hotspot is a readily available wireless connection.  Access Point : It serves as the communication.
Wireless LAN Security. Security Basics Three basic tools – Hash function. SHA-1, SHA-2, MD5… – Block Cipher. AES, RC4,… – Public key / Private key. RSA.
CWNA Guide to Wireless LANs, Second Edition Chapter Eight Wireless LAN Security and Vulnerabilities.
IPsec IPsec (IP security) Security for transmission over IP networks –The Internet –Internal corporate IP networks –IP packets sent over public switched.
WEP Case Study Information Assurance Fall or Wi-Fi IEEE standard for wireless communication –Operates at the physical/data link layer –Operates.
Wired Equivalent Privacy (WEP): The first ‘confidentiality’ algorithm for the wireless IEEE standard. PRESENTED BY: Samuel Grush and Barry Preston.
Network Security7-1 Today r Reminder Ch7 HW due Wed r Finish Chapter 7 (Security) r Start Chapter 8 (Network Management)
Intercepting Mobiles Communications: The Insecurity of ► Paper by Borisov, Goldberg, Wagner – Berkley – MobiCom 2001 ► Lecture by Danny Bickson.
Security Technologies built into std. Presented by T.R.Santhosh.
Encryption Protocols used in Wireless Networks Derrick Grooms.
Wireless Security Rick Anderson Pat Demko. Wireless Medium Open medium Broadcast in every direction Anyone within range can listen in No Privacy Weak.
INFORMATION SECURITY MANAGEMENT P ROTECTION M ECHANISMS - C RYPTOGRAPHY.
Wireless Security John Himmelein Erick Andrew Christian Adam Varun Bapna.
Authentication has three means of authentication Verifies user has permission to access network 1.Open authentication : Each WLAN client can be.
Giuseppe Bianchi Warm-up example WEP. Giuseppe Bianchi WEP lessons  Good cipher is far from being enough  You must make good USAGE of cipher.
Wired Equivalent Privacy (WEP) Chris Overcash. Contents What is WEP? What is WEP? How is it implemented? How is it implemented? Why is it insecure? Why.
Doc.: IEEE /230 Submission May 2001 William Arbaugh, University of MarylandSlide 1 An Inductive Chosen Plaintext Attack against WEP/WEP2 William.
University of Malawi, Chancellor College
WLAN Security1 Security of WLAN Máté Szalay
COEN 350 Mobile Security. Wireless Security Wireless offers additional challenges: Physical media can easily be sniffed. War Driving Legal? U.S. federal.
Lecture 3 Page 1 CS 236 Online Introduction to Cryptography CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
INFORMATION SECURITY MANAGEMENT P ROTECTION M ECHANISMS - C RYPTOGRAPHY.
Slide 1 Vitaly Shmatikov CS 378 Stream Ciphers. slide 2 Stream Ciphers uRemember one-time pad? Ciphertext(Key,Message)=Message  Key Key must be a random.
By Billy Ripple.  Security requirements  Authentication  Integrity  Privacy  Security concerns  Security techniques  WEP  WPA/WPA2  Conclusion.
EECS  Wired Equivalent Privacy (WEP) ◦ first security protocol defined in  Wi-Fi Protected Access (WPA) ◦ defined by Wi-Fi Alliance 
Wireless LAN Security Daniel Reichle Seminar Security Protocols and Applications SS2003.
หัวข้อบรรยาย Stream cipher RC4 WEP (in)security LFSR CSS (in)security.
Wireless Security Ian Bodley.
CSE 4905 WiFi Security I WEP (Wired Equivalent Privacy)
Intercepting Mobile Communications: The Insecurity of
Stream Cipher Structure
Presentation transcript:

1 Wireless Threats 1 – Cracking WEP Cracking WEP in Chapter 5 of Wireless Maximum Security by Peikari, C. and Fogie, S.

2 Cracking WEP WEP Review Data Analysis Technical Example IV Collision Key Extraction

3 WEP Review 0 Define methods through which wireless data should be secured Standardization: all vendors can build and hardware products to augment various aspects of wireless networking without to rewrite the code for each and every device. WEP uses the RC4 algorithm to encrypt its data. (RC4 is used in Secure Sockets Layer (SSL)) RC4 uses a streaming cipher that creates a unique encrypted data. It does this by combining various characteristics of a preshared password, a state value, and a value known as an initialization vector (IV) to scramble the data. This part of RC4 is known as the Key Scheduling Algorithm. The resultant array is then used to seed Pseudo-Random Generation Algorithm, which produces a stream of data that is XORed with the message (plaintext) to produce the ciphertext sent over the airwaves.

4 WEP Review 1 The transmitted data consists of the original message and the checksum. The checksum is used to protects against normal corruption, but also helps alert the user to malicious tampering. After the data is encrypted, the IV is prepended to the data, along with a bit of data that marks the packet is being encrypted. The entire bundle is then broadcast into the atmosphere, where it is caught and decrypted by the receiving party. The decryption process is the reverse of the encryption process. The IV is removed from the data packet and merged with the shared password. This value then used to recreate the KSA, which is subsequently used to recreate the keystream. The stream and encrypted data packet are XORed together, which results in the plaintext output. The CRC is then removed from the plaintext and compared against a recalcualted CRC; the packet is then either accepted or rejected.

5 Data Analysis When data is transferred via the airwaves, it can be easily capture using programs downloaded from the Internet. Through the use of WEP, all data can be scrambled to the point where it becomes unreadable. Although WEP will not stop the interception of data, it can stop the casual interpretation of the captured data. A hacker can determine what data is being sent before it is encrypted, the captured ciphertext and known plaintext can be XORed together to produce the keystream.

6 Technical Example - Principle WEP produces the ciphertext by merging only two variables together using XOR. Comparable Equation 1 depicts the final functions of the RC4 algorithm, which encrypts the data. Comparable Equation 1  Ciphertext = Plaintext XOR Keystream Comparable Equation 2  Keystream = Ciphertext XOR Plaintext

7 Technical Example – Plaintext Attack Assume  Plaintext = A = 065 =  Keystream =  Equation 1: Ciphertext = Equation 2: Keystream =

8 Technical Example – Discussion Easy to extract a keystream from encrypted data => need ciphertext and original plaintext Easy to capture the ciphertext (wireless sniffer) Obtain the original plaintext  If inside the network, capture all data before it’s encrypted. Benefit => to gain free and anonymous Internet service  Predetermine the plaintext is to trick someone into receiving or sending a predictable message. (A chat session or ), usually an full of blank spaces: (“ “) Or a long string of the same character: (“AAAAAAAAAAA”)  To look for known communication headers (determine IP address of the access point or client WNIC and make an educated guess or SNAP as the first byte in )

9 IV Collision WEP uses an initialization vector (IV) to encrypt each packet with its own key. WEP does this by merging or concatenating the preshared password with the IV to create a new exclusive “packet key” for each and every packet of information sent over the WLAN.

10 IV Collision – IV Explanation WEP uses a 3-byte IV for each packet of data transmitted over the WLAN. When the data is sent, the IV is prepended to the encrypted packet. This ensures the receiving party has all the information it needs to decrypt the data. The IV is 3x8 = 24 bits long. You have a list of 2 24 (16,777,216) possible keys. As a result of pseudo-random, one could expect to start seeing repeats (collision) after 5,000 packet transmission. Considering the average wireless device transmits a 1,500- byte packet, a collision could be expected with the transfer of just a 7-10MB file. (For example, 5,000 packets x1500 bytes = 7,000,000 bytes [7MB]. A hacker is about to send an message packed with the character “2” repeated over and over. The hacker WEP in his test lab.

11 IV Collision – Data Capture The hacker first prepares to sniff the WLAN as the predictable data is transferred. The hacker would have to maintain a listening status until he captured a matching IV. The hacker obtains  The original data using IV,  the ciphertext generated from the transmission of the original data with IV, and  The unknown ciphertext generated in another packet with the IV. Perform some bitwise calculations

12 IV Collision – Bitwise Comparisons Keystream =(Ciphertext) XOR (Plaintext) E.g. We have captured Ciphertext 1,and Ciphertext 2. We also have Plaintext 1. We can Plaintext 2 = Plaintext 1 XOR (Ciphertext 1 XOR Ciphertext 2 ) Lab01 – Bitwise comparison

13 IV Collision – Discussion A serious issue (e.g. Credit Card Number or personal information) due to the limited number of IVs and WEP process

14 Key Extraction A hacker would have to completely saturate a WLAN with known data until every IV combination is known. If a hacker knew the password, she could connect to a WLAN and become a “legitimate” user of the wireless. Due to the format of WLAN packets (SNAP header), hackers can deduce parts of the password from the encrypted WLAN data. Technical explanation can be found in the book.