TOPIC 03 - Encryption pt 01_09c3d11539bcfb5707b118154d7107a2

1. Course Overview

  • Course: CCSB2113 - Encryption Part 1

  • Instructor: Dr. Reema Ahmed

  • University: Universiti Tenaga Nasional

2. Outline

Part 1: Cryptography Concept

Part 2: Encryption Algorithm

3. Overview of Key Concepts

  • Confidentiality: Protection of information so that only authorized users can access or modify it.

  • Integrity: Assurance that information remains unaltered except by authorized entities.

  • Availability: Ensures authorized users can access data when needed.

4. Information Protection by Cryptography

4.1 Characteristics of Cryptographic Protection

  • Confidentiality: Only authorized individuals can view the data (requires a key for decryption).

  • Integrity: Data modifications can only be made by authorized users (proven with keys).

  • Availability: Data is accessible to authorized users (requires decryption key).

  • Authentication: Verifies the legitimacy of the user (ensures sender authenticity).

  • Non-repudiation: Prevents users from denying involvement in transactions.

5. Cryptography Concepts

  • Cryptography: The practice of secure communication, from Greek "kryptos" (hidden) and "gráphein" (to write).

  • Cryptanalysis: The science of breaking codes and ciphers, from Greek "kryptós" (hidden) and "analýein" (to loosen).

  • Cryptology: The study of both cryptography and cryptanalysis.

6. Uses of Encryption

6.1 Scenarios for Encryption

  • Data in transit: email, online banking, shopping.

  • Data at rest: storage on devices, hard drives.

7. Essential Cryptography Terms

  • Key: Bits used in encryption, which can be random or mathematically derived.

  • Ciphertext: The result of encryption, unreadable without decryption.

  • Plaintext: The original unencrypted text.

  • Algorithm: The mathematical process applied during encryption and decryption.

  • Decryption: Converting ciphertext back to plaintext.

  • Encryption: Converting plaintext into ciphertext.

8. Basic Principles of Cryptography

  • Encryption process requires:

    • Encryption Algorithm (E)

    • Secret Key (Ke)

  • Decryption process requires:

    • Decryption Algorithm (D)

    • Secret Key (Kd)

  • Note: Some systems function without keys (keyless ciphers).

9. Plaintext and Ciphertext Representation

9.1 Ciphertext

  • Unreadable text until decrypted.

  • Generated by applying an algorithm to plaintext and key.

9.2 Insecure Channel Illustration

  • Messages transition from plaintext to ciphertext in insecure channels.

10. Types of Ciphers

10.1 Substitution Cipher

  • Replaces one value (e.g., a letter) with another value.

  • Example: Julius Caesar used a shift of three (Caesar Cipher).

10.2 Exercises

  • Encrypt/Decrypt messages using the Caesar Cipher:

    • Example encryption: "LEARN FROM TRYING AND DOING" with key 6 results in specific ciphertext.

11. Advanced Types of Cipher

11.1 Vigenère Cipher

  • Advanced substitution cipher with varying keys for different letters.

11.2 Transposition Cipher

  • Rearranges the order of values in blocks to create ciphertext.

12. Cryptographic Algorithms

12.1 Symmetric Encryption

  • Uses one key (secret key cryptography).

12.2 Asymmetric Encryption

  • Uses two keys: public and private (public key cryptography).

13. Symmetric vs Asymmetric Encryption

13.1 Characteristics

  • Symmetric:

    • One key, faster, good for bulk data transfer.

    • Examples: DES, 3DES, AES.

  • Asymmetric:

    • Two keys, slower, prioritized for security in key exchange.

    • Examples: RSA, ECC.

14. Challenges with Symmetric Cryptography

  • Key distribution issues over networks.

  • Risk of unauthorized users gaining access to secret keys.

15. Conclusion

  • Review of encryption methods stressing the importance of both symmetric and asymmetric techniques.