(For this mainly look at the bottom half of page 3, but other terms from the rest of the Case Study which may apply can be/should be used)
- all of this is mainly from the 2nd and 3rd last paragraphs on page 3.
I. Explaing encryption and key
II. Present Techiniques & Protocols (briefly list all - remember, you can look to the actual Case Study document for this - and explanation of each)
A. Internet Protocol 1 - SSL
- explain it, including how it uses both asymmetrical and symmetrical encryption
- pros and cons
(SSL 3.1 also known as Internet Protocol 2 - TLS
- how different from SSL - not much.)
B. Other Protocols used for Internet Communication
PPTP - used for VPN
SSH - similar to SSL
Protocols used in GSM - used for phone networks
Protcols usee in WiFi - WPA & WEP & cryptophone
III. Future
The problem of extisting key length, and brute force, and backdoor methods etc.
Definition of brute force -
The influence of key length on brut
So need for more security...
Make sure here that you analyze and apply/synthesis conclusions - this is what brings you to the highest level of thinking and mark. So how they might change in the future and why.
The ky issue of the future is faster computers:
Moore's Law says that CPUs double in processing power every two years, and so any of today's encryption techniques can be eventually made useless.
For example, with "quantum computing" that the time it takes to do anything, including brute force cracking is reduced to so short a time that it doesn't matter how big your key is, it can be cracked almost immediately.
It's a constant battle between faster computers (which can brute force more and more easily) and more and more secure encryptions.
But the advantage of faster comptuers is they can deal with more "payload intensive" encryption and secuirty techniques, sush as Quantum Key distribution and Honey Encryption.
But "quantum key distribution" uses quantum computing to potitive encryption effect. Somehow two parties can share the same private key, like with SSL, but the key difference is that attempted interception of the key will be known by both parties.
Quantum mechanics are used to do the encryption.
sdfasfasdfdsafds sdfsdafas
Honey encryption - hackers and crackers get mired in the "honey" of tons of data being sent back to them in which the data to be protected cannot be found. Every time they guess the wrong password via brute force they get swamped with even more data.
One-time pad - where the key is as long as the plaintext representation of the file, and is only used once.
So a one-time pad approach used with quantum key distribution would be a very secure way.