Introduction

Encryption algorithms are fundamental components of digital security, transforming plaintext into ciphertext to protect information from unauthorized access. These algorithms fall into two broad categories: symmetric encryption (one shared key) and asymmetric encryption (a public/private key pair). This article compares several widely used encryption algorithms, explains how each works, and clarifies when to use which.

Symmetric Encryption

1. AES (Advanced Encryption Standard)

AES is the most widely used symmetric encryption algorithm today. Standardized by NIST in 2001, it encrypts data in blocks of 128 bits using key lengths of 128, 192, or 256 bits.

How it works: AES uses a substitution-permutation network. Each round applies four operations:

1. SubBytes: Non-linear byte substitution using a lookup table (S-box)
2. ShiftRows: Cyclically shifts each row of the 4x4 state matrix
3. MixColumns: Linear mixing of columns (skipped in the final round)
4. AddRoundKey: XOR the state with a round key derived from the main key

The number of rounds depends on key size: 10 rounds for AES-128, 12 for AES-192, and 14 for AES-256.

Use cases: File encryption, database encryption, VPNs, TLS/HTTPS.

2. DES (Data Encryption Standard)

DES is an older symmetric block cipher that encrypts 64-bit blocks using a 56-bit key. Published in 1977, it served as the standard for decades but is now considered insecure.

How it works: DES uses a Feistel network structure with 16 rounds of permutation and substitution. Each round splits the data block in half, applies an expansion permutation, XORs with a round key, passes through S-boxes, and permutes the result.

Why it is obsolete: The 56-bit key provides only $2^{56}$ possible keys (roughly $7.2 \times 10^{16}$). Modern hardware can brute-force this in hours. Triple DES (3DES) applied DES three times with two or three different keys but is also being phased out due to performance and block-size limitations.

3. ChaCha20

ChaCha20 is a modern stream cipher designed by Daniel J. Bernstein. Unlike AES (which is a block cipher), ChaCha20 generates a keystream that is XORed with plaintext.

Advantages over AES:

• Does not require hardware acceleration (AES-NI) to be fast. This makes it ideal for mobile devices and embedded systems.
• Resistant to timing-based side-channel attacks by design.

Use cases: TLS 1.3 (as ChaCha20-Poly1305), mobile applications, WireGuard VPN.

Asymmetric Encryption

1. RSA (Rivest-Shamir-Adleman)

RSA is the most widely deployed public-key algorithm. Its security relies on the computational difficulty of factoring large integers.

Key generation:

1. Choose two large primes $p$ and $q$.
2. Compute $n = p \cdot q$ and $\phi(n) = (p-1)(q-1)$.
3. Choose $e$ such that $1 < e < \phi(n)$ and $\gcd(e, \phi(n)) = 1$.
4. Compute $d$ such that $e \cdot d \equiv 1 \pmod{\phi(n)}$.

Encryption: $c \equiv m^e \pmod{n}$

Decryption: $m \equiv c^d \pmod{n}$

Common key sizes are 2048 or 4096 bits. Keys shorter than 2048 bits are no longer considered secure.

Use cases: Digital signatures, secure key exchange, certificate authorities.

2. ECC (Elliptic Curve Cryptography)

ECC provides equivalent security to RSA with much smaller key sizes. Its security is based on the difficulty of the Elliptic Curve Discrete Logarithm Problem (ECDLP).

How it works: ECC operates on points of an elliptic curve defined by $y^2 = x^3 + ax + b$ over a finite field. The "hard problem" is: given points $P$ and $Q = kP$ on the curve, find the scalar $k$. This is computationally infeasible for large curves.

Key size comparison: A 256-bit ECC key provides comparable security to a 3072-bit RSA key. This translates to faster computation, less bandwidth, and lower storage.

Use cases: Mobile device encryption, smart cards, IoT devices, TLS certificates.

Comparison Table

Hybrid Cryptosystems

In practice, symmetric and asymmetric encryption are used together. A typical TLS handshake works like this:

1. The client and server use asymmetric encryption (RSA or ECC) to securely exchange a symmetric key.
2. All subsequent data is encrypted with the symmetric key (AES or ChaCha20), which is much faster.

This hybrid approach combines the key distribution advantage of asymmetric encryption with the speed advantage of symmetric encryption.

Quantum Computing Considerations

Quantum computers threaten RSA and ECC because Shor's algorithm can factor large integers and solve ECDLP in polynomial time. AES is more resistant; Grover's algorithm only halves the effective key size (so AES-256 provides 128-bit security against quantum attacks). Post-quantum cryptography standards (NIST selected CRYSTALS-Kyber for key exchange and CRYSTALS-Dilithium for signatures) are designed to resist both classical and quantum attacks.

Summary

For bulk data encryption, AES is the standard choice, with ChaCha20 as an excellent alternative on platforms without hardware AES acceleration. For key exchange and digital signatures, ECC is preferred over RSA due to smaller key sizes and faster operations. DES should never be used for new systems. Understanding these trade-offs allows you to select the right algorithm for each layer of your security architecture.