DOC PREVIEW
WMU CS 5550 - Security

This preview shows page 1-2-3 out of 9 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 9 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 9 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 9 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 9 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

SecurityOutlineEncryption AlgorithmsAuthentication Protocols Message Integrity Protocols Key Distribution Firewalls Overview Cryptography functions Secret key (e.g., DES) Public key (e.g., RSA) Message digest (e.g., MD5) Security services Privacy: preventing unauthorized release of information Authentication: verifying identity of the remote participant  Integrity: making sure message has not been altered SecurityCryptographyalgorithmsPublickey(e.g., RSA)Secretkey(e.g., DES)Messagedigest(e.g., MD5)SecurityservicesAuthenticationPrivacy MessageintegritySecret Key (DES)PlaintextEncrypt withsecret keyCiphertextPlaintextDecrypt withsecret key 64- bit key (56- bits + 8- bit parity) 16 rounds• Each RoundInitial permutationRound 1Round 2Round 1656-bitkeyFinal permutation+FLi ─ 1Ri ─ 1RiKiLi Repeat for larger messages Block1IVDESCipher1Block2DESBlock3DESBlock4DES+Cipher2Cipher3Cipher4+++Public Key (RSA) Encryption & Decryptionc = memod nm = cdmod nPlaintextEncrypt withpublic keyCiphertextPlaintextDecrypt withprivate keyRSA (cont) Choose two large prime numbers p and q (each 256 bits) Multiply p and q together to get n Choose the encryption key e, such that e and (p -1) x (q -1) are relatively prime. Two numbers are relatively prime if they have no common factor greater than one Compute decryption key d such thatd = e-1mod ((p -1) x (q -1)) Construct public key as (e, n) Construct public key as (d, n) Discard (do not disclose) original primes p and qMessage Digest Cryptographic checksum  just as a regular checksum protects the receiver from accidental changes to the message, a cryptographic checksum protects the receiver from malicious changes to the message. One-way function given a cryptographic checksum for a message, it is virtually impossible to figure out what message produced that checksum; it is not computationally feasible to find two messages that hash to the same cryptographic checksum. Relevance if you are given a checksum for a message and you are able to compute exactly the same checksum for that message, then it is highly likely this message produced the checksum you were given.Authentication Protocols  Three-way handshakeClient ServerClientId, E(, CHK)E(y+, CHK)E(SK, SHK)Y Trusted third party (Kerberos) ASBE((T,L,K,B),KA),E((A,T),K),E((T,L,K,A),KB)A,BE(T + 1,K) E((T,L,K,A),KB) Public key authentication ABE(x, PublicB)xMessage Integrity Protocols Digital signature using RSA special case of a message integrity where the code can only have been generated by one participant  compute signature with private key and verify with public key Keyed MD5 sender: m + MD5(m + k) + E(k, private)  receiver recovers random key using the sender’s public key applies MD5 to the concatenation of this random key message MD5 with RSA signature sender: m + E(MD5(m), private)  receiver decrypts signature with sender’s public key compares result with MD5 checksum sent with messageMessage Integrity Protocols Digital signature using RSA special case of a message integrity where the code can only have been generated by one participant  compute signature with private key and verify with public key Keyed MD5 sender: m + MD5(m + k) + E(E(k, rcv-pub), private)  receiver recovers random key using the sender’s public key applies MD5 to the concatenation of this random key message MD5 with RSA signature sender: m + E(MD5(m), private)  receiver decrypts signature with sender’s public key compares result with MD5 checksum sent with messageKey Distribution Certificate  special type of digitally signed document: “I certify that the public key in this document belongs to the entity named in this document, signed X.” the name of the entity being certified the public key of the entity the name of the certified authority a digital signature Certified Authority (CA) administrative entity that issues certificates useful only to someone that already holds the CA’s public key.Key Distribution (cont) Chain of Trust  if X certifies that a certain public key belongs to Y, and Y certifies that another public key belongs to Z, then there exists a chain of certificates from X to Z someone that wants to verify Z’s public key has to know X’s public key and follow the chain Certificate Revocation ListFirewalls Filter-Based Solution example ( 192.12.13.14, 1234, 128.7.6.5, 80 )(*,*, 128.7.6.5, 80 ) default: forward or not forward? how dynamic?Rest of the Internet Local siteFirewallSecurity Attacks Attacks on end hosts SYN attack Attacks on routers Christmas tree packets pollute route cache Authentication attacks Distributed DoS


View Full Document

WMU CS 5550 - Security

Download Security
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Security and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Security 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?