Lesson Plan 5
Lesson Plan 5
curriculum
F4
CS
MR CHIRINDA
FOCUS: UNDERSTANDING DATA SECURITY
Success criteria
Some (A-A*): Describe and Explain the two types of Encryption In Data
Security
• The original data being sent is known as plaintext. Once it has gone
through an encryption algorithm, it produces ciphertext
Symmetric and asymmetric
encryption
• Symmetric encryption uses an encryption key; the same key is used to
encrypt and decrypt the encoded message. First of all, consider a simple
system that uses a 10-digit denary encryption key (this gives 1 × 1010
possible codes); and a decryption key. Suppose our encryption key is:
4291362856
which means every letter in a word is shifted across the alphabet +4,+2, +9,
+1, and so on, places. For example, here is the message COMPUTER
SCIENCE IS EXCITING (plaintext on the top line of Figure 2.19) before and
after applying the encryption key (forming the ciphertext shown on the
bottom line of Figure 2.19)
To get back to the original message, it will be necessary to apply the same
decryption key; that is, 4 2 9 1 3 6 2 8 5 6. But in this case, the decryption
process would be the reverse of encryption and each letter would be
shifted –4, –2, –9, –1, and so on. For example, ‘G’ ‘C’, ‘Q’ ‘O’, ‘V’ ‘M’, ‘Q’
‘P’, and so on.
However, modern computers could ‘crack’ this encryption key in a matter
of seconds. To try to combat this, we now use 256-bit binary encryption
keys that give 2256 (approximately, 1.2 × 1077) possible combinations.
(Even this may not be enough as we head towards quantum computers.)
• The real difficulty is keeping the encryption key a secret (for example,
it needs to be sent in an email or a text message which can be
intercepted). Therefore, the issue of security is always the main
drawback of symmetrical encryption, since a single encryption key is
required for both sender and recipient
Asymmetric encryption