WebPerformance

WebPerformance - Copyright © Ellis Horowitz 1999-2009 1...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Copyright © Ellis Horowitz 1999-2009 1 Lecture Secure Web Communication, Proxy Servers, and Web Server Performance Copyright © Ellis Horowitz 1999-2009 2 Implementing Secure Communication • Secure web communication – Public Key Cryptography • Public and private key encryption – Digital Certificates and Certifying Authorities – Secure Sockets Layer Protocol (SSL) and https • Web Server Performance – Popular platforms – Web Server Farms – Load Balancing • Switches • DNS redirection • Web Server as Proxy Server – Caching Copyright © Ellis Horowitz 1999-2009 2 Implementing Secure Communication • Secure web communication – Public Key Cryptography • Public and private key encryption – Digital Certificates and Certifying Authorities – Secure Sockets Layer Protocol (SSL) and https • Web Server Performance – Popular platforms – Web Server Farms – Load Balancing • Switches • DNS redirection • Web Server as Proxy Server – Caching – Using Apache as a proxy server Copyright © Ellis Horowitz 1999-2009 3 Private Key Encryption: sender/receiver share private key Public Key Encryption: for authentication Receiver has private and public keys: for privacy RPR = receiver private key SPR = sender private key RPU = receiver public key SPU = sender public key Public vs. Private key Cryptography Copyright © Ellis Horowitz 1999-2009 4 RSA Public Key Encryption • The most popular algorithm for public key encryption is the RSA algorithm • Determining the private key from the public key involves factoring very large numbers – there is no efficient algorithm for factoring large numbers • In 1999, an RSA key of 512 bits was cracked using 292 computers, 8000 MIPS-years of CPU effort and 5.2 months of time – current wisdom is that 1024 bit keys are unbreakable – Certificate Authorities use 2048 bit keys Copyright © Ellis Horowitz 1999-2009 5 Cryptographic Hash Functions • A hash function or hash algorithm is a function that maps a domain of values into a range of numbers. • Given a data item X (X could be a word or a file), H is called a cryptographic hash function if it is computationally infeasible to find another data item Y, not equal to X, such that the hash value H(X) is equal to the hash value H(Y). – H(X) is called the message digest or digital signature of X under the hashing algorithm H. • Two well known cryptographic hash functions are MD5 and SHA Copyright © Ellis Horowitz 1999-2009 6 Bulk Cipher Methods • public/private key encryption methods are not suitable for general purposes, e.g. – the RSA method can only encrypt blocks of data which are 11 bytes less than the key size; each decryption involves complex mathematical calculations • therefore, secure communication on the web uses a different encryption method for encrypting the data • a bulk cipher is one in which the same keys are used to encrypt and decrypt the data; they are fast • some sample bulk ciphers: RC2, RC4-40, RC4-56, DES40-CBC Copyright © Ellis Horowitz 1999-2009...
View Full Document

This note was uploaded on 02/24/2011 for the course CSCI 571 at USC.

Page1 / 57

WebPerformance - Copyright © Ellis Horowitz 1999-2009 1...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online