Notes 11 - WebPerformance

Notes 11 - WebPerformance - Lecture Secure Web...

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

View Full Document Right Arrow Icon
Copyright © Ellis Horowitz 1999-2010 1 Lecture Secure Web Communication, Proxy Servers, and Web Server Performance
Background image of page 1

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

View Full DocumentRight Arrow Icon
Copyright © Ellis Horowitz 1999-2010 2 3 Diverse Topics for Today 1. Secure web communication – Public Key Cryptography • Public and private key encryption – Digital Certificates and Certifying Authorities – Secure Sockets Layer Protocol (SSL) and https 2. Web Server Performance – Popular platforms – Web Server Farms – Load Balancing • Switches • DNS redirection 3. Web Server as Proxy Server – Caching – Using Apache as a proxy server
Background image of page 2
Copyright © Ellis Horowitz 1999-2010 3 Encoder/ decoder PR PR Encoder/ decoder Today is the day qaztrchubfhx Message Cipher text Today is the day Private key Private key Sender Receiver SPU SPR Encoder/ decoder Encoder/ decoder Today is the day azbycrjmfq Cipher text Today is the day Sender Receiver RPR RPU Encoder/ decoder Encoder/ decoder Today is the day % ikhzbwakr Cipher text Today is the day 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
Background image of page 3

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

View Full DocumentRight Arrow Icon
Copyright © Ellis Horowitz 1999-2010 4 RSA Public Key Encryption • The most popular algorithm for public key encryption is the RSA algorithm (Rivest, Shamir Adleman) • 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
Background image of page 4
Copyright © Ellis Horowitz 1999-2010 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
Background image of page 5

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

View Full DocumentRight Arrow Icon
Copyright © Ellis Horowitz 1999-2010 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 combination of public key encryption and conventional one way ciphers • 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
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 58

Notes 11 - WebPerformance - Lecture Secure Web...

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