2. Encryption 1

Securing Data - EncryptionWhat is Encryption?

  • Process of converting plaintext into ciphertext to secure information.

  • Aims to protect data from unauthorized access.

How Does It Work?

  • Basics:

    • An algorithm (encryption function) alters the data, making it unreadable without a key.

Encryption - Basic PrinciplesKey Concepts:

  • Involves the transformation of data (plaintext to ciphertext) using a key.

  • Encryption methods include symmetric and asymmetric techniques.

Encryption – What and Why?Purpose:

  • To protect data from interception and unauthorized alterations.

Threats:

  • Attackers may:

    • Read messages.

    • Alter messages.

    • Send false responses.

    • Mislead sender regarding message delivery.

    • Forge sender's identity.

Structure:

  • Sender, Receiver, and Attacker are part of an insecure system that needs protection.

Encryption ProcessSystem Flow:

  • Sender converts plaintext (pt) into ciphertext (ct) using Encryption (E).

  • Receiver converts ciphertext back to plaintext using Decryption (D).

Functions:

  • Encryption function: c = E(pt)

  • Decryption function: p = D(ct)

Security Conditions:

  • D should remain unknown to an attacker.

  • Direct calculation of pt from ct must be infeasible.

  • Cryptanalysis must not reveal pt without knowledge of D.

Encryption KeysKey Definitions:

  • Encrypted and decrypted using a key:

    • Encryption Key (KE)

    • Decryption Key (KD)

Key Types:

  • Symmetric Encryption: KE = KD

  • Asymmetric Encryption: KE ≠ KD

Security ComponentsDecryption Process:

  • D is an algorithm converting ct back to pt, operating in sections.

  • Vulnerability arises if either D or KD is exposed.

Public Availability:

  • Algorithms E and D can be public for scrutiny; only keys should remain secret.

Practical Encryption ConcernsBrute Force Attacks:

  • Impossible to calculate pt from ct unless the keys are small enough.

  • The key size must be large to prevent reasonable attacks.

  • Example: DES with a 56-bit key is vulnerable today (cracked in hours).

Modern Encryption

  • AES uses up to 256-bit keys.

  • Exponential key possibilities make brute-force impractical (up to ~116x10^75).

CryptanalysisTypes:

  • Analyzing patterns in ct can expose weaknesses.Examples:

  • Image encryption showing similar patterns after ciphertext generation.

Cryptanalysis MethodsTypes of Attacks:

  • Ciphertext only: Analyze patterns in ct.

  • Known plaintext: Use known data to breach keys.

  • Chosen plaintext: Generate texts, encrypt, and analyze.

  • Chosen ciphertext: Submit ciphertext for decryption analysis.

Classical Symmetric Methods

  • Focus on basic substitution ciphers and modular arithmetic for encryption strategies.

Caesar’s CipherDescription:

  • Each letter is shifted forward by a fixed amount (wraps around).

Caesar’s Cipher ExampleEncoding/Decoding:

  • Encoding: c = (p + k) (mod 26)

  • Decoding: p = (c - k) (mod 26)Keys:

  • 26 possible keys (0-25).

Modular ArithmeticConcept:

  • Evaluates expressions modulo n, remainders define behavior (wrap-around property).

Modular Arithmetic Further Examples

  • Examples Provided to clarify behaviors of various operations under modulo constraints:

    • Key calculations and their results.

Practical Problem Solving with Modular ArithmeticExercises:

  • Evaluate expressions using examples of modular encryption techniques.

Affine CryptosystemsConcept:

  • Formula: c = (a * p + b) mod 26.

Decryption in Affine CryptosystemsProcess:

  • Involves mathematical handling to derive a modular multiplicative inverse for decryption.

Finding MMI

  • Define conditions for a module multiplicative inverse to exist.

MMI Examples

  • Demonstration:

  • Examples investigating specific conditions on multiplicative equations.

MMI Solution Checking

  • Identify potential solutions and confirm through examples.

Existence of MMI

  • Elaboration on prime attributes necessary for uniqueness in cryptographic keys.

Affine Cryptosystems - Recap

  • Wrap up of the earlier relating of encryption and decryption using affine models.

Final Recap on Affine Methods

  • Out points regarding the outputs for encryption processes followed.

Weaknesses of EncryptionIncomplete Encryption Risks:

  • Discussion on why some encryption strategies can be ineffective against analysis.

Cryptanalysis Overview

  • Overview of ways to strengthen encryption and mitigate vulnerabilities.

Weakness Identification

  • Deep dive into the vulnerabilities of mono-alphabetic cryptography.

Patterns in Mono-alphabetic Cryptosystems

  • Observations regarding static mappings reveal predictable patterns vulnerable to attacks.

Patterns in English LanguageFrequency Data:

  • Letter frequency analysis to aid in deciphering plaintext.

Linear CryptanalysisKey Concepts:

  • Relationships in data lead to deducing keys using linear equations in affine systems.

Linear Cryptanalysis Example

  • Concrete applications following the principles set in previous observations testing variables.

Further Breakdown of Example

  • Solution extraction and validations training the principles of linear cryptanalysis.

Summary of Linear Cryptanalysis

  • Conclusively leading to decryption outcomes through efficient relational conclusions.

Summary Recap

  • Overview of mono-alphabetic and affine systems leading to cryptanalysis weaknesses.

Enhancements in Encryption

  • Indication of complex improvement trends toward secure encryption.

The Problem with Mapping

  • Discussion on consistent key mapping resulting in vulnerabilities against cryptanalysis.

Solutions for Mapping Issues

  • Introducing polyalphabetic ciphers to reduce repetitiveness and maintain security integrity.

Pseudorandom Key CiphersDescription:

  • Effective strategies countering static encryption by using key sequences.

Operation of Pseudorandom Ciphers

  • Understanding of operation sequences and encryption's effectiveness.

Security in Pseudorandom Key Ciphers

  • Evaluation of potential weaknesses, stressing the need for randomness in key generation.

Enigma Machine Example

  • Historical significance highlighting how the Germans implemented complex encryption schemes with the Enigma machine.

Enigma's Mechanisms

  • A breakdown of inner workings for state-based encryption revealing shifting processes for character transformation.

Summary of Polyalphabetic Ciphers

  • Comparative overview of efficiencies found in polyalphabetic strategies against mono-alphabetic pitfalls.