2.12. Cybersecurity and Privacy (CSP)

2.12. Cybersecurity and Privacy (CSP)

This area covers the mathematical foundations of modern cybersecurity and privacy-preserving technologies. It includes cryptographic protocols, security analysis, privacy-enhancing technologies, and information theory applications. The focus is on developing the mathematical understanding needed to design, analyze, and implement secure systems and privacy-preserving algorithms in the context of computational mathematics.

Table 2.12: List of KUs in the Cybersecurity and Privacy area.

2.12.1. CSP/Symmetric Cryptography  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Block ciphers and modes of operation
  • Stream ciphers
  • Cryptographic hash functions
  • Message authentication codes
  • Cryptanalysis techniques

Learning Outcomes:
Core:

  1. Implement block cipher algorithms [Usage]
  2. Apply modes of operation for encryption [Usage]
  3. Use cryptographic hash functions [Usage]
  4. Analyze cryptanalysis attacks [Assessment]

2.12.2. CSP/Asymmetric Cryptography  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Public-key cryptography principles
  • RSA cryptosystem
  • Elliptic curve cryptography
  • Diffie-Hellman key exchange
  • Digital signatures

Learning Outcomes:
Core:

  1. Implement RSA encryption and decryption [Usage]
  2. Apply elliptic curve cryptography [Usage]
  3. Use Diffie-Hellman for secure key exchange [Usage]
  4. Implement digital signature schemes [Usage]

2.12.3. CSP/Privacy-Preserving Computation  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Differential privacy
  • Homomorphic encryption
  • Secure multi-party computation
  • Federated learning privacy
  • Privacy metrics and analysis

Learning Outcomes:
Core:

  1. Apply differential privacy mechanisms [Usage]
  2. Use homomorphic encryption for private computation [Usage]
  3. Implement secure multi-party computation protocols [Usage]
  4. Analyze privacy guarantees of algorithms [Assessment]

2.12.4. CSP/Information Theory and Data Compression  (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top

Topics:
Core

  • Entropy and information measures
  • Source coding theorem
  • Channel capacity and noisy channels
  • Compression algorithms
  • Cryptographic security and information theory

Learning Outcomes:
Core:

  1. Calculate entropy and mutual information [Usage]
  2. Apply source coding to data compression [Usage]
  3. Analyze channel capacity for communication [Assessment]
  4. Implement compression algorithms [Usage]

Spotted a typo, an outdated course, a broken link, or have a suggestion? Let us know.

Scan to open on your phone