What is symmetric encryption?
Symmetric encryption is encryption in which the same secret key both encrypts and decrypts. Anyone holding the key can read the data, and anyone without it sees ciphertext that looks random. The algorithm itself is public; all of the security rests on keeping the key secret, an idea known as Kerckhoffs's principle.
Symmetric ciphers are fast. Modern processors include AES instructions, so a single core can encrypt gigabytes per second. That speed is why symmetric encryption carries the bulk data in full-disk encryption such as BitLocker, database encryption, VPN tunnels and every HTTPS session. It provides confidentiality and, in authenticated modes, integrity. It can't provide non-repudiation, because both parties hold the same key.
Common symmetric algorithms
| Algorithm | Type | Key length (bits) | Status |
|---|---|---|---|
| AES | Block cipher, 128-bit blocks | 128, 192, 256 | Current standard |
| ChaCha20 | Stream cipher | 256 | Current, common on mobile and in WireGuard |
| 3DES | Block cipher, 64-bit blocks | 168 nominal, about 112 effective | Deprecated |
| DES | Block cipher, 64-bit blocks | 56 | Broken |
| RC4 | Stream cipher | Variable | Broken, prohibited in TLS |
A 56-bit DES key was found by brute force in 56 hours by a purpose-built machine in 1998. Each added bit doubles the work, so a 128-bit AES key has about 3.4 x 10^38 possible values and is far beyond brute force. AES-256 is chosen for long-lived or regulated data and as a hedge against future quantum attacks.
Modes of operation matter as much as the algorithm
A block cipher encrypts one block at a time, so a mode of operation defines how longer data is handled. ECB encrypts every block independently, so identical plaintext blocks produce identical ciphertext and patterns survive encryption; it is unsafe for real data. CBC chains each block to the previous one, starting from a random initialization vector, but needs a separate integrity check, and mistakes there led to padding oracle attacks. GCM is an authenticated mode: one operation gives confidentiality and integrity, and any change to the ciphertext makes decryption fail. AES-GCM and ChaCha20-Poly1305 are the modern choices, and both share one strict rule: never reuse a nonce with the same key.
The key distribution problem
Both parties need the key before they can communicate securely, and they can't send it over the channel they are trying to protect. If every pair of people in a group needs its own key, the count is n(n - 1) / 2: 45 keys for 10 people and 4,950 for 100. Pre-shared keys show the pain in practice. A Wi-Fi passphrase known by 40 staff has to change on every device when one of them leaves on bad terms.
Real systems solve this with hybrid encryption. An asymmetric method, usually ephemeral Diffie-Hellman, establishes a shared session key across an open network, and a symmetric cipher then encrypts the data. TLS, SSH and IPsec all work this way.
Symmetric vs. asymmetric encryption
Symmetric encryption uses one shared key, is fast and suits bulk data, but is hard to distribute and scale. Asymmetric encryption uses a public and private key pair, is much slower and suits key exchange and digital signatures. Key lengths aren't comparable across the two: a 2048-bit RSA key is rated weaker than a 128-bit AES key.
Symmetric encryption on the CompTIA Security+ exam
Symmetric encryption falls under SY0-801 objective 1.3, which covers choosing cryptographic solutions. A scenario that stresses speed, performance, large volumes of data or encrypting a disk points to symmetric encryption, usually AES. One that stresses scalability or exchanging keys securely points to asymmetric methods. Expect DES, 3DES, RC4 and ECB mode as the weak options in vulnerability scan findings and legacy scenarios; the fix is AES-GCM or ChaCha20-Poly1305. An answer that relies on keeping the algorithm secret is security through obscurity and is never the best choice.