Encryption Methods

Why This Matters

Encryption is the backbone of every secure digital interaction you'll encounter on the exam—from HTTPS connections to messaging apps to e-commerce transactions. You're being tested on your understanding of how data confidentiality, integrity, and authentication work together to create secure communication systems. The core tension in cryptography revolves around key management, computational efficiency, and security strength, and exam questions frequently ask you to evaluate trade-offs between these factors.

Don't just memorize algorithm names—know why each method exists and what problem it solves. Can you explain why we need both symmetric and asymmetric encryption? Do you understand why hash functions aren't technically encryption? These conceptual distinctions are exactly what FRQs target. Master the underlying principles, and you'll be able to tackle any scenario the exam throws at you.

---

Symmetric vs. Asymmetric: The Fundamental Trade-Off

The most important distinction in cryptography is between single-key and dual-key systems. Symmetric encryption uses one shared key for both encryption and decryption, while asymmetric encryption uses mathematically linked key pairs. Each approach solves different problems—and creates different vulnerabilities.

Symmetric Encryption

• Single shared key—the same key encrypts and decrypts data, making the system fast but creating a critical distribution problem
• High efficiency for large data volumes because the mathematical operations are computationally simple
• Key exchange vulnerability means both parties must somehow securely share the secret key before communication begins

Asymmetric Encryption (Public Key Cryptography)

• Key pair system—a freely shared public key encrypts data that only the corresponding private key can decrypt
• Eliminates key distribution problem because the private key never needs to be transmitted
• Computationally intensive due to complex mathematical operations, making it impractical for encrypting large files directly

---

Symmetric Standards: Speed and Strength

When applications need to encrypt large amounts of data quickly, they rely on standardized symmetric algorithms. AES has become the dominant standard because it balances security strength with processing efficiency.

Advanced Encryption Standard (AES)

• U.S. government standard adopted in 2001, replacing the older DES algorithm
• Variable key lengths of 128, 192, or 256 bits allow organizations to choose their security-performance balance
• Hardware acceleration in modern processors makes AES extremely fast for real-time encryption tasks

---

Asymmetric Algorithms: Mathematical Security

Asymmetric systems derive their security from mathematical problems that are easy to compute in one direction but practically impossible to reverse. The security of these algorithms depends on computational difficulty, not secrecy of the method itself.

RSA Algorithm

• Prime number factorization—security relies on the difficulty of factoring the product of two large prime numbers
• Dual-purpose functionality enables both secure key exchange and digital signature creation
• Key sizes of 2048+ bits are now standard because computing power has made smaller keys vulnerable

Diffie-Hellman Key Exchange

• Shared secret generation—allows two parties to create a common encryption key over an insecure channel
• No direct key transmission occurs; both parties compute the same secret independently using exchanged public values
• Foundation protocol for TLS, VPNs, and most secure communication systems you use daily

---

Integrity and Authentication: Proving Data Hasn't Changed

Encryption alone doesn't guarantee that data hasn't been tampered with. Hash functions and digital signatures provide integrity verification and sender authentication—distinct security goals from confidentiality.

Hash Functions (SHA-256)

• One-way transformation—converts any input into a fixed-length output (256 bits for SHA-256) that cannot be reversed
• Collision resistance means finding two different inputs that produce the same hash is computationally infeasible
• Not encryption—hashing doesn't use keys and cannot be "decrypted"; it's used for verification, not secrecy

Digital Signatures

• Asymmetric verification—the sender signs with their private key, and anyone can verify with the public key
• Non-repudiation legally binds the sender to the message; they cannot credibly deny having sent it
• Integrity + authentication combined; a valid signature proves both who sent the message and that it wasn't altered

---

Protocols and Applications: Encryption in Practice

Individual algorithms combine into protocols that secure real-world communications. Modern security systems typically use hybrid approaches, combining asymmetric encryption for key exchange with symmetric encryption for data transfer.

Transport Layer Security (TLS)

• Hybrid protocol—uses asymmetric encryption (like RSA or Diffie-Hellman) to establish keys, then symmetric encryption (like AES) for data
• The "S" in HTTPS—TLS secures web browsing, email, and most internet communications you encounter
• Authentication via certificates verifies that you're actually connecting to the intended server, preventing impersonation

End-to-End Encryption (E2EE)

• Client-side encryption—data is encrypted on the sender's device and only decrypted on the recipient's device
• Service provider exclusion means even the company running the messaging platform cannot read user messages
• Privacy vs. lawful access creates ongoing policy debates about encryption backdoors and government surveillance

---

Emerging Technology: The Quantum Threat

Current encryption methods face a future challenge from quantum computing. Quantum computers could theoretically break RSA and other asymmetric algorithms by solving factorization problems exponentially faster than classical computers.

Quantum Cryptography

• Quantum key distribution (QKD)—uses quantum mechanical properties to detect any eavesdropping attempt on key exchange
• Theoretical unbreakability because measuring quantum states disturbs them, revealing interception
• Current limitations include requiring specialized hardware and fiber-optic connections; not yet practical for widespread use

---

Quick Reference Table

---

Self-Check Questions

1. Why do most secure communication systems use both symmetric and asymmetric encryption rather than just one type? Identify a protocol that demonstrates this hybrid approach.

2. Compare hash functions and encryption: What can encryption do that hashing cannot, and what security goal do hash functions serve?

3. If a company claims their messaging app uses end-to-end encryption, what specifically does this mean about who can and cannot read your messages?

4. Both RSA and Diffie-Hellman are asymmetric methods—what is the key functional difference between them, and when would you use each?

5. Explain why quantum computing poses a threat to current encryption methods like RSA, and how quantum cryptography attempts to address future security needs.